Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
From MaRDI portal
Publication:339584
DOI10.1016/j.cor.2012.07.001zbMath1349.90187MaRDI QIDQ339584
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.001
90C31: Sensitivity, stability, parametric optimization
90B18: Communication networks in operations research
Related Items
A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study, Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios, Affine routing for robust network design, Conditions under which adjustability lowers the cost of a robust linear program, Multipolar robust optimization, A survey of adjustable robust optimization, \(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, Multistage adaptive robust optimization for the hydrothermal scheduling problem, On the economic sustainability of supplying bandwidth policies in multi-layer wireless cognitive networks, Robust Network Design with Uncertain Outsourcing Cost
Cites Work
- Unnamed Item
- Robust delay-constrained routing in telecommunications
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Routing of uncertain traffic demands
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Robust network design in telecommunications under polytope demand uncertainty
- A new implementation of Yen's ranking loopless paths algorithm
- Adjustable robust solutions of uncertain linear programs
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- An approach to robust network design in telecommunications
- The Price of Robustness
