An approach to robust network design in telecommunications

DOI10.1051/ro:2007033zbMath1167.90425OpenAlexW2004479969MaRDI QIDQ3515394

Georgios Petrou, Adam Ouorou, Claude Lemaréchal

Publication date: 29 July 2008

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_4_411_0

zbMATH Keywords

robust optimizationtelecommunications network designcutting plane methodsmin-max-min problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Communication networks in operations research (90B18)

Related Items

Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty, On 2-stage robust LP with RHS uncertainty: complexity results and applications, Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard, Robust network design in telecommunications under polytope demand uncertainty, Unnamed Item, Single-path routing of stochastic flows in networks, Robust capacity assignment solutions for telecommunications networks with uncertain demands, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, A distributed method for optimal capacity reservation

Cites Work

• Unnamed Item
• Unnamed Item
• Routing of uncertain traffic demands
• Robust capacity assignment in telecommunications
• Design of trees in the hose model: the balanced case
• Proximity control in bundle methods for convex nondifferentiable minimization
• A Cholesky dual method for proximal piecewise linear programming
• Robust discrete optimization and its applications
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• Robust Convex Optimization
• The Cutting-Plane Method for Solving Convex Programs
• A class of network design problems with multiple demand: Model formulation and an algorithmic approach
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A central cutting plane algorithm for the convex programming problem
• Minmaxmin problems revisited
• A Modified Linear Program for Columnar Methods in Mathematical Programming