Refined cut selection for Benders decomposition: applied to network capacity expansion problems

DOI10.1007/S00186-021-00756-8MaRDI QIDQ2074837zbMATH OpenOpenAlexFDO

Authors René Brandenberg, Paul Stursberg

Publication date 11 February 2022

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00186-021-00756-8

zbMATH Keywords

alternative polyhedronBenders decompositioncutting planesdecomposition methodsfacet defining cutsPareto optimal cutsreverse polar set

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On generating maximal nondominated Benders cuts
• Tailoring Benders decomposition for uncapacitated network design
• An improved Benders decomposition applied to a multi-layer network design problem
• Accelerating Benders decomposition with heuristic master problem solutions
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Cites work

• 50 Years of Integer Programming 1958-2008
• ``Facet separation with one linear program
• A convex-analysis perspective on disjunctive cuts
• A note on the selection of Benders' cuts
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Combinatorial optimization. Theory and algorithms.
• Convex Analysis
• Disjunctive programming: Properties of the convex hull of feasible points
• Facets of the knapsack polytope
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• Identifying Minimally Infeasible Subsystems of Inequalities
• On generating maximal nondominated Benders cuts
• On the Generalized Transportation Problem
• Partitioning procedures for solving mixed-variables programming problems
• Practical enhancements to the Magnanti-Wong method
• The Benders decomposition algorithm: a literature review

Cited in

(9)

• Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models
• On generating maximal nondominated Benders cuts
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• Stabilized Benders decomposition for energy planning under climate uncertainty
• Literature review on Benders cut selection and a multiple cut generation scheme
• The ordered median tree location problem
• A novel Pareto-optimal cut selection strategy for Benders decomposition

This page was built for publication: Refined cut selection for Benders decomposition: applied to network capacity expansion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074837)