Routing Through Virtual Paths in Layered Telecommunication Networks

References

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