Survivability in hierarchical telecommunications networks

Networks

Volumn 59, Issue 1, 2012, Pages 37-58

  Fouilhoux, Pierre ^a   Karasan, Oya Ekin ^b   Mahjoub, A Ridha ^c   Ökök, Onur ^b   Yaman, Hande ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b BILKENT UNIVERSITY   (Turkey)

^c UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

branch and cut; facet; Hierarchical network; reduction operation; separation; survivability

Indexed keywords

BRANCH-AND-CUT; FACET; HIERARCHICAL NETWORK; REDUCTION OPERATION; SURVIVABILITY;

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; SEPARATION; TELECOMMUNICATION NETWORKS;

MULTIPLEXING EQUIPMENT;

EID: 83555163656     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20479     Document Type: Article

References (31)

1. E. Balas, and, M. W. Padberg, Set partitioning: A survey, SIAM Rev 18 (1976), 710-760.
2. F. Barahona, and, A. R. Mahjoub, On two-connected subgraph polytopes, Discrete Math 147 (1995), 19-34.
3. F. Bendali, I. Diarrasouba, A. R. Mahjoub, M. Didi Biha, and, J. Mailfert, A branch-and-cut algorithm for the k -edge connected subgraph problem, Networks 55 (2010), 13-32.
4. P. Chardaire, J. L. Lutton, and, A. Sutter, Upper and lower bounds for the two-level simple plant location problem, Ann of Oper Res 86 (1999), 117-140.
5. J. Current, and, H. Pirkul, The hierarchical network design problem with transshipment facilities, Euro J Oper Res 52 (1991), 338-347. (Pubitemid 21683108)
6. G. Dahl, D. Huygens, A. R. Mahjoub, and, P. Pesneau, On the k edge-disjoint 2-hop-constrained paths polytope, Oper Res Lett 34 (2006), 577-582. (Pubitemid 43851078)
7. J. Fonlupt, and, A. R. Mahjoub, Critical extreme points of the 2-edge connected spanning subraph problem, Math Program B 105 (2006), 289-310. (Pubitemid 41788322)
8. B. Fortz, and, M. Labbé, Polyhedral results for two-connected networks with bounded rings, Math Program 93 (2002), 27-54. (Pubitemid 44744752)
9. B. Fortz, M. Labbé, and, F. Maffioli, Solving the two-connected network with bounded meshes problem, Oper Res 58 (2000), 866-877. (Pubitemid 32189517)
10. B. Fortz, A. R. Mahjoub, S. T. McCormick, and, P. Pesneau, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, Math Program 105 (2006), 85-111. (Pubitemid 41705519)
11. B. Gavish, Topological design of centralized computer networks: Formulations and algorithms, Networks 12 (1982), 355-377. (Pubitemid 13488131)
12. E. Gourdin, M. Labbé, and, H. Yaman, Telecommunication and location, Facility location: Applications and theory, Chapter 9, Z. Drezner, and, H. W. Hamacher, editors, Springer, Berlin, 2001, pp. 275-305.
13. A. V. Goldberg, and, R. E. Tarjan, A new approach to the maximum flow problem, J Assoc Comput Mach 35 (1988), 931-940.
14. M. Grötschel, C. L. Monma, and, M. Stoer, Design of survivable networks, Handbooks in operations research and management Science, Vol. 7, M. O. Ball, T. L. Magnanti, C. L. Monma, and, G. L. Nemhauser, editors, Elsevier, Amsterdam, 1995, pp. 617-671.
15. J. Hao, and, J. B. Orlin, A faster algorithm for finding the minimum cut in a directed graph, J Algorithms 17 (1994), 424-446.
16. D. Huygens, A. R. Mahjoub, and, P. Pesneau, Two edge-disjoint hop-constrained paths and polyhedra, SIAM J Disc Math 18 (2004), 287-312. (Pubitemid 40672769)
17. H. Kerivin, and, A. R. Mahjoub, Design of survivable networks: A review, Networks 46 (2005), 1-21.
18. H. Kerivin, and, A. R. Mahjoub, On survivable network polyhedra, Disc Math 290 (2005), 183-210. (Pubitemid 40302917)
19. H. Kerivin, A. R. Mahjoub, and, C. Nocq, (1,2)-Survivable networks: Facets and branch-and-cut, The sharpest-cut, Chapter 9, M. Grötschel, editor, MPS/SIAM Optimization, Philadelphia, 2004, pp. 121-152.
20. J. G. Klincewicz, Hub location in backbone/tributary network design: A review, Location Science 6 (1998), 307-335.
21. M. Labbé, G. Laporte, I. R. Martin, and, J. J. S. Gonzalez, The ring star problem: Polyhedral analysis and exact algorithm, Networks 43 (2004), 177-189. (Pubitemid 38700755)
22. M. Labbé, and, H. Yaman, Solving the hub location problem in a star-star network, Networks 51 (2008), 19-33.
23. M. Labbé, H. Yaman, and, E. Gourdin, A branch and cut algorithm for hub location problems with single assignment, Math Program 102 (2005), 371-405. (Pubitemid 40878114)
24. Y. Lee, B. H. Lim, and, J. S. Park, A hub location problem in designing digital data service networks: Lagrangian relaxation approach, Location Science 4 (1996), 185-194.
25. A. R. Mahjoub, Two-edge connected spanning subgraphs and polyhedra, Math Program 64 (1994), 199-208.
26. A. R. Mahjoub, On perfectly two-edge connected graphs, Disc Math 170 (1997), 153-172. (Pubitemid 127413934)
27. G. L. Nemhauser, Integer and combinatorial optimization, Wiley, New York, 1998.
28. H. Pirkul, and, V. Nagarajan, Locating concentrators in centralized computer networks, Ann Oper Res 36 (1992), 247-262.
29. G. Reinelt, TSPLIB-a traveling salesman problem library, ORSA J Comp 3 (1991), 376-384.
30. M. Stoer, Design of survivable networks, Lecture notes in mathematics, Vol. 1531, Springer, Berlin, 1992.
31. D. Vandenbussche, and, G. L. Nemhauser, The 2-edge-connected subgraph polyhedron, J Comb Opt 9 (2005), 357-379. (Pubitemid 41202474)