An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- 1 March 1996
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 17 (1) , 127-144
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computer Codes for the Analysis of Infeasible Linear ProgramsJournal of the Operational Research Society, 1996
- The complexity and approximability of finding maximum feasible subsystems of linear relationsTheoretical Computer Science, 1995
- Some results concerning post-infeasibility analysisEuropean Journal of Operational Research, 1994
- MINOS(IIS): Infeasibility analysis using MINOSComputers & Operations Research, 1994
- On the approximability of finding maximum feasible subsystems of linear systemsLecture Notes in Computer Science, 1994
- A note on resolving infeasibility in linear programs by constraint relaxationOperations Research Letters, 1993
- A Computer-Assisted Analysis System for Mathematical Programming Models and Solutions1993
- Locating Minimal Infeasible Constraint Sets in Linear ProgramsINFORMS Journal on Computing, 1991
- Identifying Minimally Infeasible Subsystems of InequalitiesINFORMS Journal on Computing, 1990
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984