A comparison of routing sets for robust network design
From MaRDI portal
Publication:479214
DOI10.1007/S11590-013-0679-5zbMATH Open1310.90021OpenAlexW2084140196MaRDI QIDQ479214FDOQ479214
Authors: Michael Poss 
Publication date: 5 December 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0679-5
Recommendations
- Affine recourse for the robust network design problem: between static and dynamic routing
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- An approach to robust network design in telecommunications
- Robust network design: formulations, valid inequalities, and computations
Cites Work
- The Price of Robustness
- Robust solutions of uncertain linear programs
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Adjustable robust solutions of uncertain linear programs
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- Designing Least-Cost Nonblocking Broadband Networks
- Routing of uncertain traffic demands
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Robust network design: formulations, valid inequalities, and computations
- Robust capacity expansion of network flows
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Finite Adaptability in Multistage Linear Optimization
- Robust routing and optimal partitioning of a traffic demand polytope
- Affine recourse for the robust network design problem: between static and dynamic routing
- Dynamic vs. oblivious routing in network design
- On improving optimal oblivious routing
Cited In (10)
- Detecting and preventing routing problems in the planning process of CCSS\#7 networks
- \(k\)-adaptive routing for the robust network loading problem
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study)
- On the approximability of robust network design
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Affine routing for robust network design
- Robust network design with uncertain outsourcing cost
- Affine recourse for the robust network design problem: between static and dynamic routing
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
Uses Software
This page was built for publication: A comparison of routing sets for robust network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479214)
