Branch-and-Cut for the Maximum Feasible Subsystem Problem

DOI10.1137/050645828zbMath1167.90018OpenAlexW1971697593MaRDI QIDQ3608970

Marc E. Pfetsch

Publication date: 6 March 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050645828

zbMATH Keywords

branch-and-cutinfeasible linear inequality systemirreducible infeasible subsystem (IIS)maximum feasible subsystem problemminimum IIS-cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

The maximum feasible subset problem (maxFS) and applications, Dual averaging with adaptive random projection for solving evolving distributed optimization problems, Estimating the Size of Branch-and-Bound Trees, Faster maximum feasible subsystem solutions for dense constraint matrices, A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set, Identifying relatively irreducible infeasible subsystems of linear inequalities, Automatic repair of convex optimization problems, Complexity of minimum irreducible infeasible subsystem covers for flow networks, Optimization approaches to supervised classification, IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation, SCIP: solving constraint integer programs, Extending linear relaxation for non-square matrices and soft constraints, Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions, Hildreth's algorithm with applications to soft constraints for user interface layout

Uses Software

• SCIP