Pages that link to "Item:Q3418126"
From MaRDI portal
The following pages link to Provisioning virtual private networks under traffic uncertainty (Q3418126):
Displayed 27 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- Robust energy-aware routing with redundancy elimination (Q342072) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- A comparison of routing sets for robust network design (Q479214) (← links)
- Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
- Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut (Q1742250) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- Generalized hose uncertainty in single-commodity robust network design (Q2182776) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- Robust optimal discrete arc sizing for tree-shaped potential networks (Q2419569) (← links)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← links)
- A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
- Robust minimum cost flow problem under consistent flow constraints (Q2673801) (← links)
- Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty (Q2806955) (← links)
- Robust routing and optimal partitioning of a traffic demand polytope (Q3087849) (← links)
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty (Q4648697) (← links)
- A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study (Q4969341) (← links)
- Exploring the Tractability of the Capped Hose Model (Q5111705) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- Robust transshipment problem under consistent flow constraints (Q6180042) (← links)