Robust delay-constrained routing in telecommunications
From MaRDI portal
Recommendations
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Robust network design: formulations, valid inequalities, and computations
- Robust routing in communication networks
- An approach to robust network design in telecommunications
- A practicable robust counterpart formulation for decomposable functions: a network congestion case study
Cites work
- scientific article; zbMATH DE number 1717234 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- A new implementation of Yen's ranking loopless paths algorithm
- Cutset inequalities for robust network design
- Hardness of robust network design
- Mathematical models of the delay constrained routing problem
- Mixed-integer nonlinear programs featuring ``on/off constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Polynomial traffic demand polytope partitioning
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust routing in communication networks
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Routing of uncertain traffic demands
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(10)- Robust capacity assignment in telecommunications
- On the solution of stochastic optimization and variational problems in imperfect information regimes
- Robust routing in deterministic delay-tolerant networks
- Robust routing in communication networks
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- A practicable robust counterpart formulation for decomposable functions: a network congestion case study
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
- Robust multiobjective optimization with application to Internet routing
- Maximum delay computation under traffic matrix uncertainty and its application to interdomain path selection
This page was built for publication: Robust delay-constrained routing in telecommunications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363561)
