Benders decomposition: solving binary master problems by enumeration
From MaRDI portal
Publication:1785474
DOI10.1016/j.orl.2015.11.009zbMath1408.90203OpenAlexW2175364951MaRDI QIDQ1785474
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
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An improved Benders decomposition applied to a multi-layer network design problem
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Application of Benders' decomposition to power plant preventive maintenance scheduling
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- A stochastic programming approach for supply chain network design under uncertainty
- Generalized Benders decomposition
- Computational Experience with a Software Framework for Parallel Integer Programming
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- Shortest-path network interdiction
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
