TY - GEN A1 - Pfetsch, Marc T1 - A Branch-And-Cut for the Maximum Feasible Subsystem Problem N2 - We present a branch-and-cut algorithm for the NP-hard maximum feasible subsystem problem: For a given infeasible linear inequality system, determine a feasible subsystem containing as many inequalities as possible. The complementary problem, where one has to remove as few inequalities as possible in order to render the system feasible, can be formulated as a set covering problem. The rows of this formulation correspond to irreducible infeasible subsystems, which can be exponentially many. The main issue of a branch-and-cut algorithm for MaxFS is to efficiently find such infeasible subsystems. We present three heuristics for the corresponding NP-hard separation problem and discuss further cutting planes. This paper contains an extensive computational study of our implementation on a variety of instances arising in a number of applications. T3 - ZIB-Report - 05-46 KW - infeasible linear inequality system KW - irreducible infeasible subsystem KW - (IIS) maximum feasible subsystem problem KW - minimum IIS-cover KW - branch-and-cut Y1 - 2005 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/879 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-8797 ER -