Robust capacity assignment in telecommunications

DOI10.1007/s10287-006-0019-7zbMath1136.90011OpenAlexW2042861566MaRDI QIDQ867429

Adam Ouorou

Publication date: 15 February 2007

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-006-0019-7

zbMATH Keywords

robust optimizationcapacity assignment in telecommunicationscutting plane methods

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Sensitivity, stability, parametric optimization (90C31) Communication networks in operations research (90B18)

Related Items (7)

An approach to robust network design in telecommunications ⋮ A warm-start approach for large-scale stochastic linear programs ⋮ 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 ⋮ Robust routing and optimal partitioning of a traffic demand polytope

Cites Work

• Unnamed Item
• Unnamed Item
• Robust discrete optimization and its applications
• Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty
• Lectures on Modern Convex Optimization
• Robust Convex Optimization
• The Cutting-Plane Method for Solving Convex Programs
• Robust Capacity Planning Under Uncertainty
• The Price of Robustness
• A central cutting plane algorithm for the convex programming problem
• On constrained optimization by adjoint based quasi-Newton methods
• Robust Optimization of Large-Scale Systems
• A Modified Linear Program for Columnar Methods in Mathematical Programming

This page was built for publication: Robust capacity assignment in telecommunications