Accelerating the Benders decomposition method: application to stochastic network design problems
From MaRDI portal
Recommendations
- Benders decomposition for large-scale uncapacitated hub location
- An improved Benders decomposition applied to a multi-layer network design problem
- Enhancing Benders decomposition algorithm to solve a combat logistics problem
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- The Benders decomposition algorithm: a literature review
Cites work
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A multicut algorithm for two-stage stochastic linear programs
- A scenario decomposition algorithm for 0-1 stochastic programs
- A stochastic programming approach for supply chain network design under uncertainty
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders decomposition by local branching
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Computational solution of capacity planning models under uncertainty
- Convex Analysis
- Discrete cost multicommodity network optimization problems and exact solution methods
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Improving Benders decomposition using a genetic algorithm
- Inexact Cuts in Benders Decomposition
- Introduction to Stochastic Programming
- Large-scale mixed integer programming: Benders-type heuristics
- Multicommodity Distribution System Design by Benders Decomposition
- National Planning Models and Instruments
- On generating maximal nondominated Benders cuts
- Partitioning procedures for solving mixed-variables programming problems
- Practical enhancements to the Magnanti-Wong method
- Progressive hedging-based metaheuristics for stochastic network design
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
- Service network design in freight transportation
- Solving two-stage stochastic programming problems with level decomposition
- Some advances in decomposition methods for stochastic linear programming
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- The Benders decomposition algorithm: a literature review
Cited in
(31)- An improved Benders decomposition applied to a multi-layer network design problem
- The Benders decomposition algorithm: a literature review
- A demand-shifting feasibility algorithm for Benders decomposition.
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
- Decision-based scenario clustering for decision-making under uncertainty
- Enhancing Benders decomposition algorithm to solve a combat logistics problem
- A Benders decomposition-based approach for logistics service network design
- Bayesian generalized network design
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Benders decomposition for large-scale uncapacitated hub location
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- A learning-based matheuristic for stochastic multicommodity network design
- Bayesian generalized network design
- The star degree centrality problem: a decomposition approach
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- Daily scheduling of generating units with natural-gas market constraints
- Problem-driven scenario clustering in stochastic optimization
- A survey on bilevel optimization under uncertainty
- Nonconvex sensitivity-based generalized Benders decomposition
- Design of survivable wireless backhaul networks with reliability considerations
- Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19
- Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
- Benders decomposition for a reverse logistics network design problem in the dairy industry
- A mixed-integer optimization formulation for buyer formation
- Optimizing strategic and operational decisions of car sharing systems under demand uncertainty and substitution
- Last fifty years of integer linear programming: a focus on recent practical advances
- A hierarchical hub location model for the integrated design of urban and rural logistics networks under demand uncertainty
- Exploring the discrete and continuous edge improvement problems: models and algorithms
- Security-constrained unit commitment: a decomposition approach embodying Kron reduction
- A novel Pareto-optimal cut selection strategy for Benders decomposition
This page was built for publication: Accelerating the Benders decomposition method: application to stochastic network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637497)
