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.
An interior-point benders based branch-and-cut algo- rithm for mixed integer programs.Annals of Operations Research, 210:33–55
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.