Benders decomposition: solving binary master problems by enumeration

DOI10.1016/J.ORL.2015.11.009MaRDI QIDQ1785474zbMATH OpenOpenAlexFDO

Authors D. Antony Tarvin, R. Kevin Wood, Alexandra M. Newman

Publication date 28 September 2018

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2015.11.009

zbMATH Keywords

facility locationBenders decompositionexplicit enumeration

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• Accelerating Benders decomposition with heuristic master problem solutions
• On using approximations of the Benders master problem
• Open problems on Benders decomposition algorithm
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• On the separability of subproblems in Benders decompositions
• scientific article; zbMATH DE number 4008102
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• scientific article; zbMATH DE number 4014073

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A multicut algorithm for two-stage stochastic linear programs
• A stochastic programming approach for supply chain network design under uncertainty
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• An improved Benders decomposition applied to a multi-layer network design problem
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs
• Application of Benders' decomposition to power plant preventive maintenance scheduling
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• Combinatorial Benders cuts for the minimum tollbooth problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Computational experience with a software framework for parallel integer programming
• Generalized Benders decomposition
• Multicommodity Distribution System Design by Benders Decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Shortest-path network interdiction
• Solving Large-Scale Zero-One Linear Programming Problems
• Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program

Cited in

(13)

• scientific article; zbMATH DE number 4020811 (Why is no real title available?)
• A note on Benders' decomposition in mixed-integer quadratic programming
• Practical enhancements to the Magnanti-Wong method
• scientific article; zbMATH DE number 4008102 (Why is no real title available?)
• Improving Benders decomposition using a genetic algorithm
• Accelerating Benders decomposition with heuristic master problem solutions
• Implementing automatic benders decomposition in a modern MIP solver
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Simultaneously exploiting two formulations: an exact Benders decomposition approach
• Accelerating Benders decomposition by local branching
• The Benders dual decomposition method
• Open problems on Benders decomposition algorithm
• An asynchronous parallel benders decomposition method for stochastic network design problems

Describes a project that uses

Uses Software

• CHiPPS
• CPLEX

This page was built for publication: Benders decomposition: solving binary master problems by enumeration

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