Recommendations
- Provisioning virtual private networks under traffic uncertainty
- Robust routing and optimal partitioning of a traffic demand polytope
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- The robust network loading problem with dynamic routing
Cites work
- scientific article; zbMATH DE number 3871019 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1349588 (Why is no real title available?)
- scientific article; zbMATH DE number 1483018 (Why is no real title available?)
- scientific article; zbMATH DE number 1517141 (Why is no real title available?)
- scientific article; zbMATH DE number 758733 (Why is no real title available?)
- scientific article; zbMATH DE number 3354799 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A note on two problems in connexion with graphs
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Disjoint paths in a network
- Dynamic facility location: The progressive p-median problem
- Incentive pricing in multiclass systems
- Internet Routing and Related Topology Issues
- Minimum cost capacity installation for multicommodity network flows
- Models for planning capacity expansion in local access telecommunication networks
- Network Design Using Cut Inequalities
- Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
- Network flows. Theory, algorithms, and applications.
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On formulations and methods for the hop-constrained minimum spanning tree problem
- On the Extreme Rays of the Metric Cone
- Optimal internal pricing and capacity planning for service facility with finite buffer
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Steiner trees and polyhedra
- The ellipsoid method and its consequences in combinatorial optimization
- Topological design of telecommunication networks --- local access design methods
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
Cited in
(50)- Minimax models for diverse routing
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Design of trees in the hose model: the balanced case
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- Single-Source Stochastic Routing
- Robust routing and optimal partitioning of a traffic demand polytope
- Path generation for affine flow thinning
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Routing traffic at hub facilities
- Single-sink fractionally subadditive network design
- Applications of meta-heuristics to traffic engineering in IP networks
- Virtual Private Network Design Under Traffic Uncertainty
- Multipolar robust optimization
- An approach to robust network design in telecommunications
- Single-commodity robust network design with finite and hose demand sets
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Intra-domain traffic engineering with shortest path routing protocols
- Polynomial traffic demand polytope partitioning
- A distributed method for optimal capacity reservation
- Reformulations in Mathematical Programming: Definitions and Systematics
- Routing strategies under demand uncertainty
- scientific article; zbMATH DE number 1717248 (Why is no real title available?)
- On the approximability of robust network design
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Network design in scarce data environment using moment-based distributionally robust optimization
- 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
- Single-path routing of stochastic flows in networks
- Robust delay-constrained routing in telecommunications
- A resource allocation approach for the generation of service-dependent demand matrices for communications networks
- Network design with a discrete set of traffic matrices
- A comparison of routing sets for robust network design
- On total traffic domination in non-complete graphs
- Static and dynamic routing under disjoint dominant extreme demands
- Robust multiobjective optimization with application to Internet routing
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Robust network design: formulations, valid inequalities, and computations
- IGP/MPLS hybrid IP traffic planning method under uncertain traffic matrices
- scientific article; zbMATH DE number 934440 (Why is no real title available?)
- Optimal routing for minimizing the maximal link congestion
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Robust network design in telecommunications under polytope demand uncertainty
- Affine routing for robust network design
- New discoveries of domination between traffic matrices
- The robust network loading problem with dynamic routing
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- Affine recourse for the robust network design problem: between static and dynamic routing
- Intra-domain traffic engineering with shortest path routing protocols
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
This page was built for publication: Routing of uncertain traffic demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833385)
