Benders decomposition: solving binary master problems by enumeration
DOI10.1016/J.ORL.2015.11.009zbMATH Open1408.90203OpenAlexW2175364951MaRDI QIDQ1785474FDOQ1785474
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A stochastic programming approach for supply chain network design under uncertainty
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A multicut algorithm for two-stage stochastic linear programs
- Generalized Benders decomposition
- Solving Large-Scale Zero-One Linear Programming Problems
- Multicommodity Distribution System Design by Benders Decomposition
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- Title not available (Why is that?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Title not available (Why is that?)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Shortest-path network interdiction
- An improved Benders decomposition applied to a multi-layer network design problem
- Application of Benders' decomposition to power plant preventive maintenance scheduling
- Combinatorial Benders cuts for the minimum tollbooth problem
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Computational experience with a software framework for parallel integer programming
Cited In (13)
- Title not available (Why is that?)
- A note on Benders' decomposition in mixed-integer quadratic programming
- Title not available (Why is that?)
- Practical enhancements to the Magnanti-Wong method
- 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
Uses Software
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)
