Benders decomposition approach for the robust network design problem with flow bifurcations
From MaRDI portal
Publication:5326799
DOI10.1002/net.21486zbMath1269.90019OpenAlexW2153513520MaRDI QIDQ5326799
Chungmok Lee, Kyungsik Lee, Sungsoo Park
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21486
Applications of graph theory (05C90) Integer programming (90C10) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items
Robust Metric Inequalities for Network Loading Under Demand Uncertainty, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, Network design in scarce data environment using moment-based distributionally robust optimization, From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints, A robust optimization model for distribution network design under a mixed integer set of scenarios, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Designing networks with resiliency to edge failures using two-stage robust optimization, A branch and price approach for the robust bandwidth packing problem with queuing delays, Benders Decomposition for Capacitated Network Design, An exact approach for the multicommodity network optimization problem with a step cost function
Uses Software
Cites Work
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Robust linear optimization under general norms.
- An integrated model for logistics network design
- Partitioning procedures for solving mixed-variables programming problems
- A robustness approach to uncapacitated network design problems
- Minimum cost capacity installation for multicommodity network flows
- Exact solution of multicommodity network optimization problems with general step cost functions
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Robust discrete optimization and network flows
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Robust solutions of linear programming problems contaminated with uncertain data
- A survey on Benders decomposition applied to fixed-charge network design problems
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- The multi-layered network design problem
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Metric inequalities and the network loading problem
- Optimal solution of the discrete cost multicommodity network design problem
- A note on the selection of Benders' cuts
- Robust Convex Optimization
- On cut-based inequalities for capacitated network design polyhedra
- Electricity Distribution Planning Model: A Network Design Approach For Solving The Master Problem Of The Benders Decomposition Method.
- Cutting plane algorithms for robust conic convex optimization problems
- Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
- The Price of Robustness
- Tailoring Benders decomposition for uncapacitated network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Robust capacity expansion of network flows
- Capacitated Network Design—Polyhedral Structure and Computation
