Bidirected and unidirected capacity installation in telecommunication networks.

DOI10.1016/S0166-218X(03)00436-0zbMath1064.90006OpenAlexW1991826887MaRDI QIDQ1417563

Robert L. M. J. van de Leensel, Arie M. C. A. Koster, Stan P. M. van Hoesel, Savelsbergh, Martin W. P.

Publication date: 5 January 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00436-0

zbMATH Keywords

Branch-and-cutPolyhedral combinatoricsNetwork loadingTelecommunication network design

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items

Exact approaches to the single-source network loading problem, Integer programming solution approach for inventory‐production–distribution problems with direct shipments, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Algorithms for the non-bifurcated network design problem

Uses Software

• ABACUS
• CPLEX

Cites Work

• The convex hull of two core capacitated network design problems
• Minimum cost capacity installation for multicommodity network flows
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Polyhedral results for the edge capacity polytope.
• On the \(k\)-cut problem
• Backbone Network Design Tools with Economic Tradeoffs
• Technical Note—A Note on Zero-One Programming
• Faces for a linear inequality in 0–1 variables
• Facets of the knapsack polytope
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network Design Using Cut Inequalities
• Capacitated Network Design—Polyhedral Structure and Computation