The Benders Dual Decomposition Method
From MaRDI portal
Publication:5130513
DOI10.1287/opre.2019.1892zbMath1456.90108OpenAlexW3010739339MaRDI QIDQ5130513
Teodor Gabriel Crainic, Ragheb Rahmaniani, Shabbir Ahmed, Michel Gendreau, Walter Rei
Publication date: 4 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1892
Related Items
Scheduling with divisible jobs and subcontracting option, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
Cites Work
- Unnamed Item
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
- Decomposition in general mathematical programming
- On the convergence of cross decomposition
- An integrated model for logistics network design
- Practical enhancements to the Magnanti-Wong method
- Improving Benders decomposition using a genetic algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Dual decomposition in stochastic integer programming
- Decomposition methods in stochastic programming
- The Benders decomposition algorithm: a literature review
- A survey on Benders decomposition applied to fixed-charge network design problems
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- On generating maximal nondominated Benders cuts
- A scenario decomposition algorithm for 0-1 stochastic programs
- A stochastic programming approach for supply chain network design under uncertainty
- Generalized Benders decomposition
- A note on the selection of Benders' cuts
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Accelerating Benders Decomposition by Local Branching
- Introduction to Stochastic Programming
- Progressive hedging-based metaheuristics for stochastic network design
- A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing
- Minimizing a stochastic maximum-reliability path
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Benders Decomposition for Production Routing Under Demand Uncertainty
- 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
- Cross decomposition for mixed integer programming
- Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
