Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
Rui Chen, James Luedtke

TL;DR
This paper introduces a new method for generating sparse multi-term disjunctive cuts for the epigraph of functions of binary variables, improving computational efficiency and solution quality in mixed-integer linear programming.
Contribution
The paper presents a novel approach to generate multi-term disjunctive cuts using restricted variable support, enabling the use of more terms and enhancing MILP solution methods.
Findings
Sparse cuts close nearly as much gap as full disjunctive cuts.
Including these cuts significantly reduces solution time and optimality gap.
Method adapts to optimally 'tilt' valid inequalities by modifying sparse coefficients.
Abstract
We propose a new method for separating valid inequalities for the epigraph of a function of binary variables. The proposed inequalities are disjunctive cuts defined by disjunctive terms obtained by enumerating a subset of the binary variables. We show that by restricting the support of the cut to the same set of variables , a cut can be obtained by solving a linear program with constraints. While this limits the size of the set used to define the multi-term disjunction, the procedure enables generation of multi-term disjunctive cuts using far more terms than existing approaches. We present two approaches for choosing the subset of variables. Experience on three MILP problems with block diagonal structure using up to size 10 indicates the sparse cuts can often close nearly as much gap as the multi-term disjunctive cuts without this restriction and in a fraction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
