Benders decomposition approach for the robust network design problem with flow bifurcations
From MaRDI portal
(Redirected from Publication:5326799)
Recommendations
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- A robustness approach to uncapacitated network design problems
- Benders decomposition for capacitated network design
- scientific article; zbMATH DE number 2200749
- Tailoring Benders decomposition for uncapacitated network design
Cites work
- A branch-and-cut algorithm for capacitated network design problems
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
- A note on the selection of Benders' cuts
- A robustness approach to uncapacitated network design problems
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An integrated model for logistics network design
- Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Cutting plane algorithms for robust conic convex optimization problems
- Electricity Distribution Planning Model: A Network Design Approach For Solving The Master Problem Of The Benders Decomposition Method.
- Exact solution of multicommodity network optimization problems with general step cost functions
- Metric inequalities and the network loading problem
- Minimum cost capacity installation for multicommodity network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Multicommodity Distribution System Design by Benders Decomposition
- Network Design Using Cut Inequalities
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- Optimal solution of the discrete cost multicommodity network design problem
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Partitioning procedures for solving mixed-variables programming problems
- Robust capacity expansion of network flows
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust linear optimization under general norms.
- Robust solutions of linear programming problems contaminated with uncertain data
- Tailoring Benders decomposition for uncapacitated network design
- The multi-layered network design problem
- The Price of Robustness
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
Cited in
(15)- 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 comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- A branch and price approach for the robust bandwidth packing problem with queuing delays
- 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 robust optimization model for distribution network design under a mixed integer set of scenarios
- Robust critical node selection by Benders decomposition
- Benders decomposition for capacitated network design
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- An exact approach for the multicommodity network optimization problem with a step cost function
- scientific article; zbMATH DE number 2200749 (Why is no real title available?)
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
This page was built for publication: Benders decomposition approach for the robust network design problem with flow bifurcations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326799)
