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

DOI10.1007/s00186-021-00756-8zbMath1485.90064OpenAlexW3211811167MaRDI QIDQ2074837

René Brandenberg, Paul Stursberg

Publication date: 11 February 2022

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

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

zbMATH Keywords

decomposition methodscutting planesBenders decompositionalternative polyhedronfacet defining cutsPareto optimal cutsreverse polar set

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

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

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