Violation-based, diversity-based via k-medoids, and hybrid Benders cut filtering strategies solve more instances and cut solve times by 55-57% compared to adding all cuts.
A novel Pareto-optimal cut selection strategy for Benders decomposition.Mathematical Programming Computation, 18(1):211–257
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
Violation-based, diversity-based via k-medoids, and hybrid Benders cut filtering strategies solve more instances and cut solve times by 55-57% compared to adding all cuts.