Identifying Minimally Infeasible Subsystems of Inequalities
From MaRDI portal
Publication:4021366
DOI10.1287/ijoc.2.1.61zbMath0752.90050MaRDI QIDQ4021366
Jennifer K. Ryan, John Gleeson
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2.1.61
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C10: Integer programming
15A39: Linear inequalities of matrices
Related Items
Generating all vertices of a polyhedron is hard, Constraint classification in mathematical programming, HySAT: An efficient proof engine for bounded model checking of hybrid systems, IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation, Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, MINOS(IIS): Infeasibility analysis using MINOS, Some results concerning post-infeasibility analysis, Sensivitiy analysis for assessing preferentially independent order relations, Consistency, redundancy, and implied equalities in linear systems, Finding the minimum weight IIS cover of an infeasible system of linear inequalities, An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem, Reasoning on infeasibility in distributed collaborative computing environment, On exact selection of minimally unsatisfiable subformulae, Analyzing infeasible nonlinear programs, Information-based branching schemes for binary linear mixed integer problems, Repairing MIP infeasibility through local branching, Generalized filtering algorithms for infeasibility analysis, Detecting IIS in infeasible linear programmes using techniques from goal programming, A note on the selection of Benders' cuts
