From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints

DOI10.1016/j.disopt.2018.04.003zbMath1506.90071OpenAlexW2809615149MaRDI QIDQ1662655

Daniel Cosmin Porumbel

Publication date: 20 August 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2018.04.003

zbMATH Keywords

Benders decompositioncutting-planesintersection sub-problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items

Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, Projective Cutting-Planes

Cites Work

• Benders, metric and cutset inequalities for multicommodity capacitated network design
• Partitioning procedures for solving mixed-variables programming problems
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• The Benders decomposition algorithm: a literature review
• A survey on Benders decomposition applied to fixed-charge network design problems
• Exact approaches to the single-source network loading problem
• Length-bounded cuts and flows
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Benders decomposition approach for the robust network design problem with flow bifurcations
• Programming with linear fractional functionals
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation