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

DOI10.1016/J.DISOPT.2018.04.003zbMATH Open1506.90071OpenAlexW2809615149WikidataQ129625500 ScholiaQ129625500MaRDI QIDQ1662655FDOQ1662655

Authors: 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

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Tailoring Benders decomposition for uncapacitated network design
• On the separability of subproblems in Benders decompositions
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
• Intersection cuts for polynomial optimization

zbMATH Keywords

Benders decompositioncutting-planesintersection sub-problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

This page was built for publication: From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints

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