Identifying Minimally Infeasible Subsystems of Inequalities
From MaRDI portal
Publication:4021366
DOI10.1287/ijoc.2.1.61zbMath0752.90050OpenAlexW1974450603MaRDI 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
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Linear inequalities of matrices (15A39)
Related Items
K-best feasible clusters - ranking optimal solutions from an infeasible LP, Some results concerning post-infeasibility analysis, Fast, flexible MUS enumeration, Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints, A note on the selection of Benders' cuts, Sensivitiy analysis for assessing preferentially independent order relations, Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures, Shattering inequalities for learning optimal decision trees, 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, HySAT: An efficient proof engine for bounded model checking of hybrid systems, Human-centred feasibility restoration in practice, An algorithm for binary linear chance-constrained problems using IIS, Irreducible infeasible subsystems of semidefinite systems, Block-sparse recovery of semidefinite systems and generalized null space conditions, Repairing MIP infeasibility through local branching, Generalized filtering algorithms for infeasibility analysis, Identifying relatively irreducible infeasible subsystems of linear inequalities, The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT), Complexity of minimum irreducible infeasible subsystem covers for flow networks, Constraint classification in mathematical programming, Debugging unsatisfiable constraint models, Information-based branching schemes for binary linear mixed integer problems, On exact selection of minimally unsatisfiable subformulae, IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation, Analyzing infeasible nonlinear programs, Generating all vertices of a polyhedron is hard, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, Refined cut selection for Benders decomposition: applied to network capacity expansion problems, Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems, Conflict Analysis for MINLP, Detecting IIS in infeasible linear programmes using techniques from goal programming, Stoichiometric and Constraint-Based Analysis of Biochemical Reaction Networks, MINOS(IIS): Infeasibility analysis using MINOS
