Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
From MaRDI portal
Publication:2029367
DOI10.1016/j.ejor.2020.08.037zbMath1487.90487OpenAlexW3052995245MaRDI QIDQ2029367
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
mixed integer programmingbranch-and-cutBenders' decompositionconstraint integer programmingoptimisation software
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Set covering heuristics in a benders decomposition for railway timetabling, Uncertainty in maritime ship routing and scheduling: a literature review, Parallel subgradient algorithm with block dual decomposition for large-scale optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recoverable robust single day aircraft maintenance routing problem
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Integrated airline scheduling
- Practical enhancements to the Magnanti-Wong method
- An improved Benders decomposition applied to a multi-layer network design problem
- Partitioning procedures for solving mixed-variables programming problems
- MINTO, a Mixed INTeger Optimizer
- Parallel branch, cut, and price for large-scale discrete optimization
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- The Benders decomposition algorithm: a literature review
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- PySP: modeling and solving stochastic programs in Python
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- On parallelizing dual decomposition in stochastic integer programming
- Measuring the impact of primal heuristics
- A stochastic programming approach for supply chain network design under uncertainty
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Generalized Benders decomposition
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- Improving the Integer L-Shaped Method
- On a New Collection of Stochastic Linear Programming Test Problems
- Computational Experience with a Software Framework for Parallel Integer Programming
- Minimizing a stochastic maximum-reliability path
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Benchmarking optimization software with performance profiles.