A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
From MaRDI portal
Publication:1744909
DOI10.1007/s10589-017-9956-zzbMath1416.90044OpenAlexW2767818495MaRDI QIDQ1744909
Publication date: 20 April 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9956-z
Benders decompositionbudgeted uncertaintydynamic routingaffine routingrobust network loadingstatic routingvolume routing
Related Items (3)
Generalized hose uncertainty in single-commodity robust network design ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ \(k\)-adaptive routing for the robust network loading problem
Uses Software
Cites Work
- Unnamed Item
- Single-commodity robust network design with finite and hose demand sets
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- Solving survivable two-layer network design problems by metric inequalities
- A comparison of routing sets for robust network design
- The convex hull of two core capacitated network design problems
- Routing of uncertain traffic demands
- On improving optimal oblivious routing
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Robust network design in telecommunications under polytope demand uncertainty
- An improved Benders decomposition applied to a multi-layer network design problem
- Minimum cost capacity installation for multicommodity network flows
- Adjustable robust solutions of uncertain linear programs
- Multi-service multi-facility network design under uncertainty
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Separating tight metric inequalities by bilevel programming
- The robust network loading problem with dynamic routing
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Metric inequalities and the network loading problem
- Using mixed-integer programming to solve power grid blackout problems
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
- Distributionally Robust Convex Optimization
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- The Price of Robustness
- Designing Least-Cost Nonblocking Broadband Networks
- The cut property under demand uncertainty
- Network Design Using Cut Inequalities
- Provisioning a virtual private network
- Design of Survivable Networks Using Three- and Four-Partition Facets
- Robust capacity expansion of network flows
- Robust network design: Formulations, valid inequalities, and computations
- Affine recourse for the robust network design problem: Between static and dynamic routing
- Benders decomposition approach for the robust network design problem with flow bifurcations
- A polyhedral study of the capacity formulation of the multilayer network design problem
- Robust solutions for network design under transportation cost and demand uncertainty
- k-Partition-based facets of the network design problem
- Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
This page was built for publication: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
