A comparison of routing sets for robust network design
From MaRDI portal
Publication:479214
DOI10.1007/s11590-013-0679-5zbMath1310.90021OpenAlexW2084140196MaRDI QIDQ479214
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
Related Items (6)
Robust Network Design with Uncertain Outsourcing Cost ⋮ Affine routing for robust network design ⋮ \(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 ⋮ On the approximability of robust network design ⋮ Decomposition for adjustable robust linear optimization subject to uncertainty polytope
Uses Software
Cites Work
- Dynamic vs. oblivious routing in network design
- Routing of uncertain traffic demands
- On improving optimal oblivious routing
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Robust solutions of uncertain linear programs
- Adjustable robust solutions of uncertain linear programs
- Robust routing and optimal partitioning of a traffic demand polytope
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- The Price of Robustness
- Designing Least-Cost Nonblocking Broadband Networks
- Finite Adaptability in Multistage Linear Optimization
- Provisioning a virtual private network
- 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
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: A comparison of routing sets for robust network design
