Pages that link to "Item:Q3418126"
From MaRDI portal
The following pages link to Provisioning virtual private networks under traffic uncertainty (Q3418126):
Displayed 9 items.
- 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)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← 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)
- 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)