Solving the hub location problem in a star-star network

Networks

Volumn 51, Issue 1, 2008, Pages 19-33

  Labbé, Martine ^a   Yaman, Hande ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Branch and cut; Hub location; Lagrangian relaxation; Polyhedral analysis; Star star network

Indexed keywords

HEURISTIC METHODS; NETWORK ROUTING; OPTIMIZATION; PROBLEM SOLVING;

HUB LOCATION; LAGRANGIAN RELAXATION; POLYHEDRAL ANALYSIS; STAR-STAR NETWORK;

TELECOMMUNICATION NETWORKS;

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

References (45)

1. K. Aardal, Capacitated facility location: Separation algorithms and computational experience, Math Program 81 (1988), 149-175.
2. P. Avella and A. Sassano, On the p-median polytope, Math Program 89 (2001), 395-411.
3. E. Balas, Projection with a minimal system of inequalities, Computat Optim Applic 10 (1998), 189-193.
4. E. Balas, "Projection and lifting in combinatorial optimization", Computational Combinatorial Optimization, M. Jünger and D. Naddef (Editors), Springer, 2001.
5. E. Balas and M. Oosten, On the dimension of the projected polyhedra, Discrete Appl Math 87 (1998), 1-9.
6. E.J. Beasley, OR-Library: Distributing test problems by electronic mail, J Oper Res Soc 41 (1990), 1069-1072.
7. E.J. Beasley, Lagrangean heuristics for location problems, Eur J Oper Res 65 (1993), 383-399.
8. N. Boland, M. Krishnamoorthy, A.T. Ernst, and J. Ebery, Preprocessing and cutting for multiple allocation hub location problems, Eur J Oper Res 155 (2004), 638-653.
9. TB. Boffey, Location problems arising in computer networks, J Oper Res Soc 40 (1989), 347-354.
10. J.F. Campbell, Integer programming formulations of discrete hub location problems, Eur J Oper Res 72 (1994), 387-105.
11. J.F. Campbell, A.T. Ernst, and M. Krishnamoorthy, "Hub location problems", Facility Location: Applications and Theory, Z. Drezner and H.W. Hamacher (Editors), Springer, 2002, pp. 373-107.
12. P. Chardaire, J.L. Lutton, and A. Sutter, Upper and lower bounds for the two-level simple plant location problem, Ann Oper Res 86 (1999), 117-140.
13. S. Chung, Y. Myung, and D. Tcha, Optimal design of a distributed network with a two-level hierarchical structure, Eur J Oper Res 62 (1992), 105-115.
14. G. Cornuéjols, G.L. Nemhauser, and L.A. Wolsey, "The uncapacitated facility location problem", Discrete Location Theory, P.B. Mirchandani and R.L. Francis (Editors), Wiley, New York, 1990, pp. 119-171.
15. G. Cornuéjols, R. Sridharan, and J.M. Thizy, A comparison of heuristics and relaxations for the capacitated plant location problem, Eur J Oper Res 50 (1991), 280-297.
16. J. Ebery, Solving large single allocationp-hub problems with two or three hubs, Eur J Oper Res 128 (2001 ), 447-158.
17. A.T. Ernst and M. Krishnamoorthy, Efficient algorithms for the uncapacitated single allocation p-hub median problem, Loc Sci 4(1996), 139-154.
18. A.T. Ernst and M. Krishnamoorthy, An exact solution approach based on shortest paths forp-hub median problems, INFORMS J Comput 10 (1998), 149-162.
19. B. Gavish, Topological design of centralized computer networks: Formulations and algorithms, Networks 12 (1982), 355-377.
20. E. Gourdin, M. Labbé, and H. Yaman, "Telecommunication and location", Facility Location: Applications and Theory, Z. Drezner and H.W. Hamacher (Editors), Springer, 2002, pp. 275-305.
21. H.W. Hamacher, M. Labbé, S. Nickel, and T Sonneborn, Adapting polyhedral properties from facility to hub location problems, Discrete Appl Math 145 (2004), 104-116.
22. S .L. Hakimi, Optimum locations of switching centers and the absolute centers and medians of a graph, Oper Res 12(1964), 450-459.
23. S.L. Hakimi, Optimum distribution of switching centers in a communication network and some related graph theoretic problems, Oper Res 13 (1965), 462-475.
24. J. Hardin, J. Lee, and J. Leung, On the Boolean-quadratic packing uncapacitated facility-location polytope, Ann Oper Res 83 (1998), 77-94.
25. M.P. Helme and T.L. Magnanti, Designing satellite communication networks by zero-one quadratic programming, Networks 19 (1989), 427-450.
26. M. Jünger and S. Thienel, The ABACUS System for branch-and-cut-and- price algorithms in integer programming and combinatorial optimization, Software Pract Exper 30 (2000), 1325-1352.
27. J.G. Klincewicz, Hub location in backbone/tributary network design: A review, Loc Sci 6 (1998), 307-335.
28. J. Krarup and P.M. Pruzan, The simple plant location problem: Survey and synthesis, Eur J Oper Res 12 (1983), 36-81.
29. M. Labbé, D. Peeters, and J.F. Thisse, "Location on networks", Network Routing, Handbooks in Operations Research and Management Sciences, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Vol. 8, North-Holland, Amsterdam, 1995, pp. 551-624.
30. M. Labbé and H. Yaman, Polyhedral analysis for concentrator location problems, Computational Optimization and Applications 34 (2006), 377-407.
31. M. Labbé, H. Yaman, and E. Gourdin, A branch and cut algorithm for hub location problems with single assignment, Math Program 102 (2005), 371-105.
32. Y. Lee, B.H. Lim, and J.S. Park, A hub location problem in designing digital data service networks: Lagrangian relaxation approach, Loc Sci 4 (1996), 185-194.
33. A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds, Networks 15 (1985), 1-20.
34. M.E. O' Kelly, A quadratic integer program for the location of interacting hub facilities, Eur J Oper Res 32 ( 1987), 393-404.
35. H. Pirkul, Efficient algorithms for the capacitated concentrator location problem, Comput Oper Res 14 (1987), 197-208.
36. H. Pirkul and V. Nagarajan, Locating concentrators in centralized computer networks, Ann Oper Res 36 (1992), 247-262.
37. H. Pirkul and D. Schilling, An efficient procedure for designing single allocation hub and spoke systems, Mgmt Sei 44 (1998), S235-S242.
38. D. Skorin-Kapov, J. Skorin-Kapov, and M. O'Kelly, Tight linear programming relaxations of uncapacitated p-hub median problem, Eur J Oper Res 94 (1996), 582-593.
39. J. Sohn and S. Park, A linear program for the two hub location problem, Eur J Oper Res 100 (1997), 617-622.
40. J. Sohn and S. Park, The single allocation problem in the interacting three hub network, Networks 35 (2000), 17-25.
41. R. Sridharan, The capacitated plant location problem, Eur J Oper Res 87 (1995), 203-213.
42. J.C. Picard and H.D. Ratliff, Minimum cuts and related problems, Networks 5 (1975), 357-370.
43. L.A. Wolsey, Integer Programming, Wiley, New York, 1998.
44. H. Yaman, Concentrator Location in Telecommunications Networks, Springer, 2005.
45. D. Yuan, "An annotated bibliography in communication network design and routing," Optimization Models and Methods for Communication Network Design and Routing, Ph.D., Thesis, Department of Mathematics, Linköping University, Sweden, 2001.