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-ZzbMATH Open1416.90044OpenAlexW2767818495MaRDI QIDQ1744909FDOQ1744909
Authors: Sara Mattia, Michael Poss 
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
Recommendations
- The robust network loading problem with dynamic routing
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Solving the bifurcated and nonbifurcated robust network loading problem with \(k\)-adaptive routing
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- \(k\)-adaptive routing for the robust network loading problem
Benders decompositionbudgeted uncertaintydynamic routingaffine routingrobust network loadingstatic routingvolume routing
Cites Work
- Robust optimization
- The Price of Robustness
- The convex hull of two core capacitated network design problems
- Minimum cost capacity installation for multicommodity network flows
- Adjustable robust solutions of uncertain linear programs
- The robust network loading problem with dynamic routing
- Single-commodity robust network design with finite and hose demand sets
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- Designing Least-Cost Nonblocking Broadband Networks
- Network Design Using Cut Inequalities
- Robust solutions for network design under transportation cost and demand uncertainty
- k-Partition-based facets of the network design problem
- Routing of uncertain traffic demands
- Metric inequalities and the network loading problem
- Using mixed-integer programming to solve power grid blackout problems
- Solving survivable two-layer network design problems by metric inequalities
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Design of survivable networks using three- and four-partition facets
- Robust network design: formulations, valid inequalities, and computations
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- An improved Benders decomposition applied to a multi-layer network design problem
- Separating tight metric inequalities by bilevel programming
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- Robust capacity expansion of network flows
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Robust network design in telecommunications under polytope demand uncertainty
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- A polyhedral study of the capacity formulation of the multilayer network design problem
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- A comparison of routing sets for robust network design
- Affine recourse for the robust network design problem: between static and dynamic routing
- On improving optimal oblivious routing
- Distributionally Robust Convex Optimization
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Multi-service multi-facility network design under uncertainty
- The cut property under demand uncertainty
- Optimizing flow thinning protection in multicommodity networks with variable link capacity
Cited In (12)
- Robust routing and optimal partitioning of a traffic demand polytope
- \(k\)-adaptive routing for the robust network loading problem
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- A comparison of routing sets for robust network design
- A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Solving the bifurcated and nonbifurcated robust network loading problem with \(k\)-adaptive routing
- The robust network loading problem with dynamic routing
- Generalized hose uncertainty in single-commodity robust network design
- Affine recourse for the robust network design problem: between static and dynamic routing
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
Uses Software
This page was built for publication: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744909)
