Robust network design in telecommunications under polytope demand uncertainty
From MaRDI portal
(Redirected from Publication:976502)
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
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Adjustable robust solutions of uncertain linear programs
- An Algorithm for Separable Nonconvex Programming Problems
- An approach to robust network design in telecommunications
- Descent methods for quasidifferentiable minimization
- Duality in nonconvex optimization
- Minmaxmin problems revisited
- Newton's method for convex programming and Tschebyscheff approximation
- Robust optimization-methodology and applications
- Robust solutions of uncertain linear programs
- Routing of uncertain traffic demands
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(13)- An approach to robust network design in telecommunications
- 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
- Determining reliable networks of prepositioning materiel warehouses for public-sector rapid response supplies
- Affine decision rules for tractable approximations to robust capacity planning in telecommunications
- Designing robust coverage networks to hedge against worst-case facility losses
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Robust network design with uncertain outsourcing cost
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- rDAN: toward robust demand-aware network designs
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)
