Cost-efficient network synthesis from leased lines

Annals of Operations Research

Volumn 76, Issue , 1998, Pages 1-20

  Alevras, Dimitris ^a   Grötschel, Martin ^b   Wessäly, Roland ^b  

^a IBM   (United States)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Cutting plane algorithm; Heuristics; Network capacity planning; Routing; Survivable networks; Telecommunication network design

Indexed keywords

EID: 0041722535     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018984102311     Document Type: Article

References (18)

1. D. Alevras, M. Grötschel and R. Wessäly, A network dimensioning tool, Preprint SC 96-49, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 1996.
2. F. Barahona, Network design using cut inequalities, SIAM Journal on Optimization 6(1996)823-837.
3. D. Bienstock, S. Chopra, O. Günlük and C.-Y. Tsai, Minimum cost capacity installation for multicommodity network flows, Mathematical Programming, Special Issue on Computational Integer Programming (1995).
4. D. Bienstock and O. Günlük, Computational experience with a difficult mixed-integer multicommodity flow problem, Mathematical Programming 68(1995)213-237.
5. A. Bley, Node-disjoint length-restricted paths, Diplomarbeit, TU Berlin, Germany, 1997.
6. CPLEX Optimization, Inc., Suite 279, 930 Tahoe Blvd., Bldg 802, Incline Village, NV 89451, USA, Using the CPLEX Callable Library, 1995. Information available via WWW at URL http:// www.cplex.com.
7. G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing (to appear).
8. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
9. M. Grötschel and C.L. Monma, Integer polyhedra associated with certain network design problems with connectivity constraints, SIAM Journal on Discrete Mathematics 3(1990)502-523.
10. M. Grötschel, C.L. Monma and M. Stoer, Design of survivable networks, in: Handbooks in Operations Research and Management Science, volume on Network Models, North-Holland, 1995, chap. 10, pp. 617-672.
11. M. Iri, On an extension of the maximum-flow minimum-cut theorem to multicommodity flows, Journal of the Operations Research Society of Japan 13(1971)129-135.
12. O. Kakusho and K. Onaga, On feasibility conditions of multicommodity flows in networks, Transactions on Circuit Theory 18(1971)425-429.
13. A. Lisser, R. Sarkissian and J.P. Vial, Optimal joint syntheses of base and spare telecommunication networks, Technical Report, University of Geneva, November 1995.
14. T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Operations Research 43(1995)142-156.
15. M. Minoux, Optimum synthesis of a network with non-simultaneous multicommodity flow requirements, in: Studies on Graphs and Discrete Programming, P. Hansen, ed., North-Holland, 1981, pp. 269-277.
16. Y. Pochet and L.A. Wolsey, Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation, Discrete Applied Mathematics 59(1995)57-74.
17. M. Stoer, Design of Survivable Networks, Lecture Notes in Mathematics, vol. 1531, Springer, 1992.
18. M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik 68(1994)149-167.