Partition inequalities for capacitated survivable network design based on directed p-cycles

Discrete Optimization

Volumn 5, Issue 2, 2008, Pages 415-433

  Atamtürk, Alper ^a   Rajan, Deepak ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Mixed integer rounding; p cycles; Partition inequalities; Polyhedra; Survivable network design

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS;

MIXED-INTEGER ROUNDING; PARTITION INEQUALITIES; SURVIVABLE NETWORK DESIGN;

ELECTRIC NETWORK ANALYSIS;

EID: 41249092072     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2007.08.002     Document Type: Article

References (41)

1. Alevras D., Grötschel M., and Wessäly R. Cost-efficient network synthesis from leased lines. Annals of Operations Research 76 (1998) 1-20
2. Altinkemer K. Topological design of ring networks. Computers and Operations Research 21 (1994) 421-431
3. Atamtürk A. On capacitated network design cut-set polyhedra. Mathematical Programming 92 (2002) 425-437
4. Atamtürk A., and Rajan D. On splittable and unsplittable flow capacitated network design arc-set polyhedra. Mathematical Programming 92 (2002) 315-333
5. Avella P., Mattia S., and Sassano A. Metric inequalities and the network loading problem. In: Bienstock D., and Nemhauser G. (Eds). Lecture Notes in Computer Science vol. 3064 (2004), Springer-Verlag 16-32
6. Balakrishnan A., Magnanti T.L., and Mirchandani P. Network design. In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated Bibliographies in Combinatorial Optimization (1997), John Wiley & Sons
7. Balakrishnan A., Magnanti T.L., and Mirchandani P. Connectivity-splitting models for survivable network design. Networks 43 (2004) 10-27
8. Balakrishnan A., Magnanti T.L., Sokol J.S., and Wang Y. Modeling and solving the single facility line restoration problem. Operations Research 50 (2002) 617-635
9. Barahona F. Network design using cut inequalities. SIAM Journal on Optimization 6 (1996) 823-837
10. D. Bienstock, 2001. Personal communication
11. Bienstock D., and Günlük O. Capacitated network design - Polyhedral structure and computation. INFORMS Journal on Computing 8 (1996) 243-259
12. Bienstock D., and Muratore G. Strong inequalities for capacitated survivable network design problems. Mathematical Programming 89 (2000) 127-147
13. Chopra S., Gilboa I., and Sastry S.T. Source sink flows with capacity installation in batches. Discrete Applied Mathematics 85 (1998) 165-192
14. Cosares S., Deutsch D.N., Saniee I., and Wasem O.J. SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic network. Interfaces 25 (1995) 20-40
15. Dahl G., and Stoer M. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing 10 (1998) 1-11
16. Dantzig G.B. Linear programming under uncertainty. Management Science 1 (1955) 197-206
17. Goldschmidt O., Laugier A., and Olinick E.V. SONET/SDH ring assignment with capacity constraints. Discrete Applied Mathematics 129 (2003) 99-128
18. W. Grover, D. Stamatelakis, Cycle-oriented distributed pre-configuration: Ring-like speed with mesh-like capacity for self-planning network restoration, in: Proceedings of IEEE International Conference on Communications, 1998, pp. 537-543
19. W.D. Grover, R.G. Martens, Optimized design of ring-mesh hybrid networks, in: Proceedings of IEEE/VDE Design of Reliable Communication Networks 2000, 2000, pp. 291-297
20. Günlük O. A branch-and-cut algorithm for capacitated network design problems. Mathematical Programming 86 (1999) 17-39
21. Herzberg M., Bye S.J., and Utano A. The hop-limit approach for spare capacity assignment in survivable networks. IEEE/ACM Transactions on Networking 3 (1995) 775-784
22. Iri M. On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan 13 (1971) 129-135
23. Kennington J.L., and Lewis M.W. The path restoration version of the spare capacity allocation problem with modularity restrictions: Models, algorithms, and an empirical analysis. INFORMS Journal on Computing 13 (2001) 181-190
24. A. Lisser, R. Sarkissian, J.P. Vial, Survivability in telecommunication networks, Technical Report 1995.3, University of Geneva, 1995
25. Magnanti T.L., and Mirchandani P. Shortest paths, single origin-destination network design, and associated polyhedra. Networks 23 (1993) 103-121
26. Magnanti T.L., Mirchandani P., and Vachani R. The convex hull of two core capacitated network design problems. Mathematical Programming 60 (1993) 233-250
27. Magnanti T.L., Mirchandani P., and Vachani R. Modeling and solving the two-facility capacitated network loading problem. Operations Research 43 (1995) 142-157
28. Magnanti T.L., and Raghavan S. Strong formulations for network design problems with connectivity requirements. Networks 45 (2005) 61-79
29. Nemhauser G.L., and Wolsey L.A. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Mathematical Programming 46 (1990) 379-390
30. Onaga K., and Kakusho O. On feasibility conditions of multi-commodity flows in networks. Transactions on Circuit Theory 18 (1971) 425-429
31. D. Rajan, Designing capacitated survivable networks: Polyhedral analysis and algorithms, Ph.D. Thesis, University of California-Berkeley, Berkeley, USA, 2004
32. Rajan D., and Atamtürk A. Survivable network design: Routing of flows and slacks. In: Anandalingam G., and Raghavan S. (Eds). Telecommunications Network Design and Management (2002), Kluwer Academic Publishers 65-81
33. Rajan D., and Atamtürk A. A directed cycle based column-and-cut generation method for capacitated survivable network design. Networks 43 (2004) 201-211
34. D.A. Schupke, G.C. Gruber, A. Autenrieth, Optimal configuration of p-cycles in WDM networks, in: IEEE International Conference on Communications, 2002
35. J.B. Slevinsky, W.D. Grover, M.H. MacGregor, An algorithm for survivable network design employing multiple self-healing rings, in: Proceedings of IEEE GLOBECOM 1993, 1993, pp. 1568-1572
36. Soriano P., Wynants C., Séguin R., Labbé M., Gendreau M., and Fortz B. Design and dimensioning of survivable SDH/SONET networks. In: Sansò B., and Soriano P. (Eds). Telecommunications Network Planning (1998), Kluwer Academic Publishers, Netherlands 147-168
37. Stamatelakis D., and Grover W.D. Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles"). IEEE Transactions on Communications 48 (2000) 1262-1265
38. van Hoesel S.P.M., Koster A.M.C.A., van~de Leensel R.L.M.J., and Savelsbergh M.W.P. Bidirected and unidirected capacity installation in telecommunication networks. Discrete Applied Mathematics 133 (2004) 103-121
39. B. Venables, W.D. Grover, M.H. MacGregor, Two strategies for spare capacity placement in mesh restorable networks, in: Proceedings of IEEE International Conference on Communications 1993, 1993, pp. 267-271
40. Wolsey L.A. Integer Programming (1998), John Wiley and Sons, New York
41. Xiong Y., and Mason L.G. Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Transactions on Networking 7 (1999) 98-110