Network design with a discrete set of traffic matrices

DOI10.1016/J.ORL.2013.04.011MaRDI QIDQ2450673zbMATH OpenOpenAlexFDO

Authors Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen

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

zbMATH Keywords

ring networkrobust network designsingle source demands

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 432987
• On the approximability of some network design problems
• On the approximability of some network design problems
• scientific article; zbMATH DE number 2161745
• Approximation algorithms for a capacitated network design problem

Cites work

• A compact formulation of the ring loading problem with integer demand splitting
• A simplified NP-complete MAXSAT problem
• A tight bound on approximating arbitrary metrics by tree metrics
• An algorithm for node-capacitated ring routing
• An efficient algorithm for the ring loading problem with integer demand splitting
• An exact algorithm for robust network design
• An improved approximation algorithm for requirement cut
• An improved LP-based approximation for Steiner tree
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Design of trees in the hose model: the balanced case
• Designing Least-Cost Nonblocking Broadband Networks
• Domination Between Traffic Matrices
• Hardness of robust network design
• scientific article; zbMATH DE number 5485556 (Why is no real title available?)
• scientific article; zbMATH DE number 4010182 (Why is no real title available?)
• Matroids and integrality gaps for hypergraphic Steiner tree relaxations
• Multicommodity flows in planar graphs
• Multicommodity Flows in Ring Networks
• Multicuts and integral multiflows in rings
• Node-Capacitated Ring Routing
• On the Complexity of the Asymmetric VPN Problem
• Optimization, approximation, and complexity classes
• Proof verification and the hardness of approximation problems
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Routing of uncertain traffic demands
• The Ring Loading Problem
• The steiner problem in graphs

Cited in

(9)

• Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
• Minimizing worst-case and average-case makespan over scenarios
• Multi-hour network planning based on domination between sets of traffic matrices
• Approximating multi commodity network design on graphs of bounded pathwidth and bounded degree
• scientific article; zbMATH DE number 432987 (Why is no real title available?)
• scientific article; zbMATH DE number 5669750 (Why is no real title available?)
• scientific article; zbMATH DE number 2161745 (Why is no real title available?)
• Single-sink fractionally subadditive network design
• Traffic-redundancy aware network design

This page was built for publication: Network design with a discrete set of traffic matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450673)