A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Branch-and-Cut for the Maximum Feasible Subsystem Problem
2008
SIAM Journal on Optimization
This paper presents a branch-and-cut algorithm for the NPhard 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 make 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.
doi:10.1137/050645828
fatcat:w7syhnzs75fm7dgd2tpbn3pyae