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.
Machine learning for cutting planes in integer programming: A survey
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2verdicts
UNVERDICTED 2representative citing papers
Decision-focused training creates linear surrogates for MILPs that include original constraints and accurately predict optimal solutions, outperforming neural network proxies in case studies.
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.
-
Decision-Focused Surrogate Modeling for Mixed-Integer Linear Optimization
Decision-focused training creates linear surrogates for MILPs that include original constraints and accurately predict optimal solutions, outperforming neural network proxies in case studies.