Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework

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)

Recommendations

Cites work

Q4475618 scientific article; zbMATH DE number 2084694 (Why is no real title available?)
Q4735940 scientific article; zbMATH DE number 2084782 (Why is no real title available?)
Q5241193 scientific article; zbMATH DE number 7124428 (Why is no real title available?)
A Modified Benders' Partitioning Algorithm for Mixed Integer Programming A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
A New Scenario Decomposition Method for Large-Scale Stochastic Optimization A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem 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 A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
A stochastic programming approach for supply chain network design under uncertainty A stochastic programming approach for supply chain network design under uncertainty
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
An improved Benders decomposition applied to a multi-layer network design problem 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 An interior-point Benders based branch-and-cut algorithm for mixed integer programs
Automatic Dantzig-Wolfe reformulation of mixed integer programs Automatic Dantzig-Wolfe reformulation of mixed integer programs
Benchmarking optimization software with performance profiles. Benchmarking optimization software with performance profiles.
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Computational experience with a software framework for parallel integer programming Computational experience with a software framework for parallel integer programming
Dantzig-Wolfe decomposition and branch-and-price solving in G12 Dantzig-Wolfe decomposition and branch-and-price solving in G12
Generalized Benders decomposition Generalized Benders decomposition
Improving the integer L-shaped method Improving the integer L-shaped method
Integrated airline scheduling Integrated airline scheduling
MINTO, a Mixed INTeger Optimizer MINTO, a Mixed INTeger Optimizer
Measuring the impact of primal heuristics Measuring the impact of primal heuristics
Minimizing a stochastic maximum-reliability path Minimizing a stochastic maximum-reliability path
Multicommodity Distribution System Design by Benders Decomposition Multicommodity Distribution System Design by Benders Decomposition
On a new collection of stochastic linear programming test problems On a new collection of stochastic linear programming test problems
On parallelizing dual decomposition in stochastic integer programming On parallelizing dual decomposition in stochastic integer programming
Parallel branch, cut, and price for large-scale discrete optimization Parallel branch, cut, and price for large-scale discrete optimization
Partitioning procedures for solving mixed-variables programming problems Partitioning procedures for solving mixed-variables programming problems
Practical enhancements to the Magnanti-Wong method Practical enhancements to the Magnanti-Wong method
PySP: modeling and solving stochastic programs in Python PySP: modeling and solving stochastic programs in Python
Recoverable robust single day aircraft maintenance routing problem Recoverable robust single day aircraft maintenance routing problem
Strengthened benders cuts for stochastic integer programs with continuous recourse Strengthened benders cuts for stochastic integer programs with continuous recourse
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
The Benders decomposition algorithm: a literature review The Benders decomposition algorithm: a literature review
The integer \(L\)-shaped method for stochastic integer programs with complete recourse The integer \(L\)-shaped method for stochastic integer programs with complete recourse
\textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite

Cited in

(11)

Describes a project that uses

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)