Hardness of robust network design
From MaRDI portal
Publication:3593369
DOI10.1002/net.20165zbMath1119.90005MaRDI QIDQ3593369
No author found.
Publication date: 20 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2108/12068
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Robust network design: Formulations, valid inequalities, and computations, Affine recourse for the robust network design problem: Between static and dynamic routing, Further contributions to network optimization, Affine routing for robust network design, Telecommunications network design: Technology impacts and future directions, Single-commodity robust network design with finite and hose demand sets, Robust delay-constrained routing in telecommunications, Competitive and deterministic embeddings of virtual networks, A comparison of routing sets for robust network design, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, On 2-stage robust LP with RHS uncertainty: complexity results and applications, Static and dynamic routing under disjoint dominant extreme demands, On total traffic domination in non-complete graphs, Dynamic vs. oblivious routing in network design, Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard, On improving optimal oblivious routing, Design of trees in the hose model: the balanced case, A capacitated hub location problem under hose demand uncertainty, Robust multiobjective optimization with application to Internet routing, Multipolar robust optimization, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, On the approximability of robust network design, A distributed method for optimal capacity reservation, The robust network loading problem with dynamic routing, New discoveries of domination between traffic matrices, Network design with a discrete set of traffic matrices, Vertex Sparsification in Trees, Robust routing and optimal partitioning of a traffic demand polytope
Cites Work
- Geometric algorithms and combinatorial optimization
- On the power of unique 2-prover 1-round games
- Simpler and better approximation algorithms for network design
- Provisioning a virtual private network
- Automata, Languages and Programming
- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
