2 citations · 2 across the 2 of their papers we have counts for
4 papers · 1 filter
Monoidal strengthening of simple -polyhedral disjunctive cuts
Aleksandr M. Kazachkov, Egon Balas
Disjunctive cutting planes can tighten a relaxation of a mixed-integer linear program. Traditionally, such cuts are obtained by solving a higher-dimensional linear program, whose a…
-Polyhedral Disjunctive Cuts
Egon Balas, Aleksandr M. Kazachkov
We introduce -polyhedral disjunctive cuts (VPCs) for generating valid inequalities from general disjunctions. Cuts are critical to integer programming solvers, but the…
When Lift-and-Project Cuts are Different
Egon Balas, Thiago Serra
In this paper, we present a method to determine if a lift-and-project cut for a mixed-integer linear program is irregular, in which case the cut is not equivalent to any intersecti…
Partial hyperplane activation for generalized intersection cuts
Aleksandr M. Kazachkov, Selvaprabu Nadarajah, Egon Balas +1
The generalized intersection cut (GIC) paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investig…