Robust network design in telecommunications under polytope demand uncertainty

DOI10.1016/j.ejor.2010.03.007zbMath1188.90062MaRDI QIDQ976502

Claude Lemaréchal, Georgios Petrou, Adam Ouorou

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

zbMATH Keywords

robust optimization; polyhedral uncertainty; min-max-min problems; telecommunication network design

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90B18: Communication networks in operations research

90C27: Combinatorial optimization

Related Items

Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Determining reliable networks of prepositioning materiel warehouses for public-sector rapid response supplies, Robust capacity assignment solutions for telecommunications networks with uncertain demands, Robust Network Design with Uncertain Outsourcing Cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing of uncertain traffic demands
• Descent methods for quasidifferentiable minimization
• Newton's method for convex programming and Tschebyscheff approximation
• Duality in nonconvex optimization
• Robust solutions of uncertain linear programs
• Adjustable robust solutions of uncertain linear programs
• Robust optimization-methodology and applications
• The Cutting-Plane Method for Solving Convex Programs
• An approach to robust network design in telecommunications
• Minmaxmin problems revisited
• An Algorithm for Separable Nonconvex Programming Problems