Routing through virtual paths in layered telecommunication networks

Operations Research

Volumn 47, Issue 5, 1999, Pages 693-702

  Dahl, Geir ^a   Martin, Alexander ^b   Stoer, Mechthild ^c  

^a UNIVERSITY OF OSLO   (Norway)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c TELENOR RESEARCH   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; MATHEMATICAL MODELS; RESOURCE ALLOCATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

INTEGER LINEAR PROGRAMMING MODEL; LAYERED TELECOMMUNICATION NETWORKS;

LINEAR PROGRAMMING;

EID: 0033351564     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.5.693     Document Type: Article

References (19)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. Applegate, D., R. E. Bixby, V. Chvátal, W. Cook. 1995. Finding cuts in the TSP. DIMACS Technical Report 95-05, March. Available at http://dimacs.rutgers.edu.
3. Bienstock, D., S. Chopra, O. Günlük, C-Y. Tsai. 1998. Minimum cost capacity installation for multicommodity network flows. Math. Programming 81(2) 177-199.
4. Chartrand, G., L. Lesniak. 1986. Graphs and Digraphs. Wadsworth and Brooks, CA.
5. Goldberg, A. V., R. E. Tarjan. 1988. A new approach to the maximum flow problem. J. ACM 35 921-940.
6. Grötschel, M., A. Martin, R. Weismantel. 1996a. Packing Steiner trees: polyhedral investigations. Math. Programming 72(2) 101-123.
7. _, _, _. 1996b. Packing Steiner trees: a cutting plane algorithm and computational results. Math. Programming 72(2) 125-145.
8. Kramer, M. R., J. van Leeuwen. 1984. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. Advances in Computing Research, Vol. 2: VLSI Theory. F. P. Preparata (ed.) Jai Press, London, UK.
9. Lorentzen, R. 1994. Mathematical methods and algorithms in the network utilization planning tool RUGINETT. Telektronikk 90 (4) 73-82.
10. Lovász, L., M. D. Plummer. 1986. Matching Theory. NorthHolland, Amsterdam.
11. Martin, A. 1992. Packen von Steinerbäumen: Polyedrische Studien und Anwendungen. Ph.D. Thesis, Konrad-Zuse-Zentrum (ZIB), Berlin, TR 92-4.
12. Menger, K. 1927. Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10 96-115.
13. Nemhauser, G., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
14. Padberg, M., G. Rinaldi. 1991. A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33 60-100.
15. Park, K., S. Kang, S. Park. 1994. An integer programming approach to the bandwidth packing problem. Unpublished, Dept. of Industrial Engineering, Korea Advanced Institute of Science and Technology, Taejon, Korea.
16. Parker, M., J. Ryan. 1994. A column generation algorithm for bandwidth packing. Telecommunications Systems 2 185-195.
17. Prim, R. C. 1957. Shortest connection networks and some generalizations. Bell System Tech. J. 36 1389-1401.
18. Schrijver, A. 1986. Theory of Linear and Integer Programming. Wiley, Chichester, UK.
19. Weismantel, R. 1994. On the 0/1 knapsack polytope. Konrad-Zuse-Zentrum (ZIB), Berlin, Preprint SC 94-1.