An asynchronous parallel benders decomposition method for stochastic network design problems

DOI10.1016/J.COR.2023.106459MaRDI QIDQ6551056zbMATH OpenFDO

Authors Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

Publication date 6 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106459

zbMATH Keywords

benders decompositionbranch-and-cutnetwork designparallel computingstochastic programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Accelerating Benders decomposition by local branching
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
• An improved L-shaped method for solving process flexibility design problems
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs
• Analysis of stochastic problem decomposition algorithms in computational grids
• Benders decomposition: solving binary master problems by enumeration
• Computational assessment of distributed decomposition methods for stochastic linear programs
• Decomposition algorithms for stochastic programming on a computational grid
• Decomposition methods in stochastic programming
• Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
• Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 1453001 (Why is no real title available?)
• Introduction to Stochastic Programming
• Nested Benders decomposition and dynamic programming for reservoir optimisation
• Parallel branch, cut, and price for large-scale discrete optimization
• Parallelization and aggregation of nested Benders decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Progressive hedging-based metaheuristics for stochastic network design
• Scalable parallel Benders decomposition for stochastic linear programming
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program
• The Benders decomposition algorithm: a literature review
• The Benders dual decomposition method
• The design of robust value-creating supply chain networks: a critical review

Cited in

(1)

• Resilient transportation network design with disruption uncertainty and lead times

This page was built for publication: An asynchronous parallel benders decomposition method for stochastic network design problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551056)