Robust capacity assignment in telecommunications

DOI10.1007/S10287-006-0019-7MaRDI QIDQ867429zbMATH OpenOpenAlexFDO

Authors 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, stability, parametric optimization (90C31) Sensitivity (robustness) (93B35) Communication networks in operations research (90B18)

Recommendations

• Robust capacity assignment solutions for telecommunications networks with uncertain demands
• Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
• Robust network design in telecommunications under polytope demand uncertainty
• Affine decision rules for tractable approximations to robust capacity planning in telecommunications
• Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty
• Telecommunication network capacity design for uncertain demand
• Robust delay-constrained routing in telecommunications
• Optimal capacity assignment in general queueing networks
• Robust capacity expansion of network flows
• Routing and capacity assignment in backbone communication networks

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 1834580 (Why is no real title available?)
• A Modified Linear Program for Columnar Methods in Mathematical Programming
• A central cutting plane algorithm for the convex programming problem
• Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• On constrained optimization by adjoint based quasi-Newton methods
• Robust Capacity Planning Under Uncertainty
• Robust Optimization of Large-Scale Systems
• Robust convex optimization
• Robust discrete optimization and its applications
• The Cutting-Plane Method for Solving Convex Programs
• The Price of Robustness

Cited in

(14)

• Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty
• Robust capacity assignment solutions for telecommunications networks with uncertain demands
• Telecommunication network capacity design for uncertain demand
• Robust routing and optimal partitioning of a traffic demand polytope
• An approach to robust network design in telecommunications
• A warm-start approach for large-scale stochastic linear programs
• Provider selection and task allocation in telecommunications with QoS degradation policy
• 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
• Single-path routing of stochastic flows in networks
• Optimal routing for minimizing the maximal link congestion
• Optimizing subscriber migrations for a telecommunication operator in uncertain context
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• Capacity scheduling for data services over digital networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867429)