Network design with a discrete set of traffic matrices
From MaRDI portal
Publication:2450673
DOI10.1016/j.orl.2013.04.011zbMath1286.90023OpenAlexW2051229026MaRDI QIDQ2450673
Laura Sanità, Rico Zenklusen, Gianpaolo Oriolo
Publication date: 14 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.04.011
Related Items (3)
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix ⋮ Minimizing worst-case and average-case makespan over scenarios ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- A simplified NP-complete MAXSAT problem
- Routing of uncertain traffic demands
- Design of trees in the hose model: the balanced case
- An improved approximation algorithm for requirement cut
- A compact formulation of the ring loading problem with integer demand splitting
- Multicuts and integral multiflows in rings
- Multicommodity flows in planar graphs
- Optimization, approximation, and complexity classes
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An algorithm for node-capacitated ring routing
- An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
- An improved LP-based approximation for steiner tree
- An Exact Algorithm for Robust Network Design
- Proof verification and the hardness of approximation problems
- Hardness of robust network design
- On the Complexity of the Asymmetric VPN Problem
- Designing Least-Cost Nonblocking Broadband Networks
- The Ring Loading Problem
- Provisioning a virtual private network
- Domination Between Traffic Matrices
- Matroids and integrality gaps for hypergraphic steiner tree relaxations
- The steiner problem in graphs
- Multicommodity Flows in Ring Networks
- Node-Capacitated Ring Routing
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Network design with a discrete set of traffic matrices
