Routing Through Virtual Paths in Layered Telecommunication Networks

  title={Routing Through Virtual Paths in Layered Telecommunication Networks},
  author={Geir Dahl and Alexander Martin and Mechthild Stoer},
  journal={Operations Research},
We study a network connguration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traac demand. The problem is formulated as an integer linear programming model where 0-1 variables represent diierent paths. An associated integral polytope is studied and diier-ent classes of facets are described. These results are used in a cutting plane algorithm. Computational results for some realistic problems are reported. 
24 Citations
5 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-5 of 5 references

Shortest connection networks and some generalizations

  • R. C. Prim
  • Bell System Technical Journal
  • 1957

Mathematical methods and algorithms in the networkutilization planning tool RUGINETT

  • R. Lorentzen
  • Telektronikk

The complexity of wirerouting and nding minimumarea layouts for arbitrary VLSI circuits

  • R. Weismantel, M. R. Kramer, J. van Leeuwen

Similar Papers

Loading similar papers…