Robust network design in telecommunications under polytope demand uncertainty
DOI10.1016/J.EJOR.2010.03.007zbMATH Open1188.90062OpenAlexW2035216330MaRDI QIDQ976502FDOQ976502
Authors: Claude Lemaréchal, Adam Ouorou, Georgios Petrou 
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.007
Recommendations
- An approach to robust network design in telecommunications
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- Robust network design: formulations, valid inequalities, and computations
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
Numerical mathematical programming methods (65K05) Convex programming (90C25) Combinatorial optimization (90C27) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- Robust solutions of uncertain linear programs
- The Cutting-Plane Method for Solving Convex Programs
- An Algorithm for Separable Nonconvex Programming Problems
- Robust optimization-methodology and applications
- Title not available (Why is that?)
- Duality in nonconvex optimization
- Newton's method for convex programming and Tschebyscheff approximation
- Adjustable robust solutions of uncertain linear programs
- Routing of uncertain traffic demands
- An approach to robust network design in telecommunications
- Title not available (Why is that?)
- Minmaxmin problems revisited
- Descent methods for quasidifferentiable minimization
Cited In (13)
- Robust optimization model for a dynamic network design problem under demand uncertainty
- Robust capacity assignment in telecommunications
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Designing robust coverage networks to hedge against worst-case facility losses
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- An approach to robust network design in telecommunications
- Determining reliable networks of prepositioning materiel warehouses for public-sector rapid response supplies
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Affine decision rules for tractable approximations to robust capacity planning in telecommunications
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- Robust network design with uncertain outsourcing cost
- rDAN: toward robust demand-aware network designs
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
This page was built for publication: Robust network design in telecommunications under polytope demand uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976502)
