SOS1 constraints require that at most one of a given set of variables is nonzero. In this article, we investigate a branch-and-cut algorithm to solve linear programs with SOS1 constraints. We focus on the case in which the SOS1 constraints overlap. The corresponding conflict graph can algorithmically be exploited, for instance, for improved branching rules, preprocessing, primal heuristics, and cutting planes. In an extensive computational study, we evaluate the components of our implementation on instances for three different applications. We also demonstrate the effectiveness of this approach by comparing it to the solution of a mixed-integer programming formulation, if the variables appearing in SOS1 constraints are bounded.
TU Darmstadt, Department of Mathematics, Research Group Optimization, Graduate School of Computational Engineering, Dolivostr. 15, 64293 Darmstadt, April 2015
View Branch-and-Cut for Linear Programs with Overlapping SOS1 Constraints