Routing Through Virtual Paths in Layered Telecommunication Networks
Geir Dahl, Alexander Martin, Mechthild Stoer
Operations Research · 1999 · Volume 47 · Issue 5
Abstract
We study a network configuration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traffic demand. The problem is formulated as an integer linear programming model where 0–1 variables represent different paths. An associated integral polytope is studied, and different classes of facets are described. These results are used in a cutting plane algorithm. Computational results for some realistic problems are reported.
Keywords
communications, telecommunication, networks/graphs, design and path packing, combinatorics, polyhedral combinatorics
Enable JavaScript for citation tools and additional paper interactions.