The following pages link to Hardness of robust network design (Q3593369):
Displayed 28 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Robust delay-constrained routing in telecommunications (Q363561) (← links)
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- A comparison of routing sets for robust network design (Q479214) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
- Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
- On total traffic domination in non-complete graphs (Q631212) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- On improving optimal oblivious routing (Q833579) (← links)
- Design of trees in the hose model: the balanced case (Q867917) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
- Multipolar robust optimization (Q1731824) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- A distributed method for optimal capacity reservation (Q2322374) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- New discoveries of domination between traffic matrices (Q2401765) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- Vertex Sparsification in Trees (Q2971161) (← links)
- Robust routing and optimal partitioning of a traffic demand polytope (Q3087849) (← 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)
- Further contributions to network optimization (Q5487817) (← links)
- Affine routing for robust network design (Q6065910) (← links)
- Telecommunications network design: Technology impacts and future directions (Q6087074) (← links)