Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
DOI10.1016/J.EJOR.2020.08.037zbMATH Open1487.90487OpenAlexW3052995245MaRDI QIDQ2029367FDOQ2029367
Authors: Stephen J. Maher 
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.08.037
Recommendations
- The Benders decomposition algorithm: a literature review
- Implementing automatic benders decomposition in a modern MIP solver
- Integrating Benders Decomposition Within Constraint Programming
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- scientific article; zbMATH DE number 2084693
branch-and-cutmixed integer programmingBenders' decompositionconstraint integer programmingoptimisation software
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- PySP: modeling and solving stochastic programs in Python
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- Benchmarking optimization software with performance profiles.
- Practical enhancements to the Magnanti-Wong method
- 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 Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- Measuring the impact of primal heuristics
- Generalized Benders decomposition
- On a new collection of stochastic linear programming test problems
- Multicommodity Distribution System Design by Benders Decomposition
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- On parallelizing dual decomposition in stochastic integer programming
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Minimizing a stochastic maximum-reliability path
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- An improved Benders decomposition applied to a multi-layer network design problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integrated airline scheduling
- Recoverable robust single day aircraft maintenance routing problem
- MINTO, a Mixed INTeger Optimizer
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Title not available (Why is that?)
- The Benders decomposition algorithm: a literature review
- Parallel branch, cut, and price for large-scale discrete optimization
- Computational experience with a software framework for parallel integer programming
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Improving the integer L-shaped method
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
Cited In (7)
- Title not available (Why is that?)
- A demand-shifting feasibility algorithm for Benders decomposition.
- Set covering heuristics in a benders decomposition for railway timetabling
- Uncertainty in maritime ship routing and scheduling: a literature review
- An enhanced Benders decomposition method for unique shortest path routing
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
Uses Software
This page was built for publication: Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029367)
