Disjunctive Benders decomposition integrates disjunctive programming with Benders cuts to produce convex hull inequalities via existing oracles, removing the need for MIP master problems in mixed-binary linear programs.
Mixed 0-1 programming by lift-and- project in a branch-and-cut framework.Management Science, 42(9):1229–1246, 1996
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Disjunctive Benders Decomposition
Disjunctive Benders decomposition integrates disjunctive programming with Benders cuts to produce convex hull inequalities via existing oracles, removing the need for MIP master problems in mixed-binary linear programs.