Provisioning virtual private networks under traffic uncertainty
DOI10.1002/NET.20145zbMATH Open1131.90012OpenAlexW4229690180MaRDI QIDQ3418126FDOQ3418126
Mustafa Ç. Pınar, E. Amaldi, Ayşegül Altın, Pietro Belotti
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/27113
cutting planesnetwork designbranch and pricetraffic uncertaintyvirtual private networksrobust optimization mixed-integer linear programs
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)
Cites Work
Cited In (28)
- A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study
- Robust combinatorial optimization with knapsack uncertainty
- Exploring the Tractability of the Capped Hose Model
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Robust routing and optimal partitioning of a traffic demand polytope
- The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Virtual private network design over the first Chvátal closure
- Single-commodity robust network design with finite and hose demand sets
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Experiments on virtual private network design with concave capacity costs
- Robust network design: Formulations, valid inequalities, and computations
- Robust transshipment problem under consistent flow constraints
- A capacitated hub location problem under hose demand uncertainty
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty
- Affine recourse for the robust network design problem: Between static and dynamic routing
- A comparison of routing sets for robust network design
- Robust energy-aware routing with redundancy elimination
- Robust minimum cost flow problem under consistent flow constraints
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- The robust network loading problem with dynamic routing
- Generalized hose uncertainty in single-commodity robust network design
- Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
- Designing networks with resiliency to edge failures using two-stage robust optimization
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
This page was built for publication: Provisioning virtual private networks under traffic uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418126)