Lagrangean relaxation-based techniques for solving facility location problems

International Series in Operations Research and Management Science

Volumn 155, Issue , 2011, Pages 391-420

  Marianov, Vladimir ^a   Galvão, Roberto D ^b  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959193257     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-7572-0_17     Document Type: Chapter

References (57)

1. Baker BM, Sheasby J (1999) Accelerating the convergence of subgradient optimisation. Euro J Oper Res 117:136-144
2. Barceló J, Casanovas J (1984) A heuristic Lagrangean algorithm for the capacitated plant location problem. Euro J Oper Res 15:212-226
3. Bazaraa M, Sherali HD (1981) On the choice of step sizes in subgradient optimization. Euro J Oper Res 7:380-388
4. Beasley JE (1993) Lagrangean heuristics for location problems. Euro J Oper Res 65: 383-399
5. Bilde O, Krarup J (1967) Bestemmelse of optimal beliggenhed af produktionssteder. Research Report, IMSOR, Technical University of Denmark
6. Bilde O, Krarup J (1977) Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann Discrete Math 1:79-97
7. Boffey TB, Karkazis J (1984) p-medians and multi-medians. J Oper Res Soc 35:57-64
8. Campbell JF (1994) Integer programming formulations of discrete hub location problems. Euro J Oper Res 72: 387-405
9. Cánovas L, García SE, Marín A (2006) Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Ann Oper Res 130: 163-178
10. Chen B, Guignard M (1998) Polyhedral analysis and decompositions for capacitated plant location- type problems. Discrete Appl Math 82:79-91
11. Christofides N, Beasley JE (1982) A tree search algorithm for the p-median problem. Euro J Oper Res 10:196-204
12. Cortinhal MJ, Captivo ME (2003) Upper and lower bounds for the single source capacitated location problem. Euro J Oper Res 151:333-351
13. Diehr G (1972) An algorithm for the p-median problem. Working Paper No. 191, Western Management Science Institute, University of California, Los Angeles
14. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26:992- 1009
15. Espejo LGA, Galvão RD, Boffey B (2003) Dual-based heuristics for a hierarchical covering location problem. Comput Oper Res 30: 165-180
16. Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Manage Sci 27:1-18
17. Galvão RD (1980) A dual-bounded algorithm for the p-median problem. Oper Res 28: 1112-1121
18. Galvão RD (1981) A note on Garfinkel, Neebe and Rao's LP decomposition for the p-median problem. Transp Sci 15: 175-182
19. Galvão RD (1993) The use of Lagrangean relaxation in the solution of uncapacitated facility location problems. Location Sci 1:57-79
20. Galvão RD, Raggi LA (1989) A method for solving to optimality uncapacitated location problems. Ann Oper Res 18:225-244
21. Galvão RD, Espejo LGA, Boffey B (2000) A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Eur J Oper Res 124: 377-389
22. Garfinkel RS, Neebe AW, Rao MR (1974) An algorithm for the m-median plant location problem. Transp Sci 8:217-236
23. Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math Program Study 2: 82-114
24. Guignard M (1988) A Lagrangean dual ascent algorithm for simple plant location problems. Eur J Oper Res 35: 193-200
25. Guignard M, Kim S (1987) Lagrangean decomposition for integer programming: theory and applications. RAIRO- Recherche Opérationnelle 21:307-323
26. Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12: 450-459
27. Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13: 462-475
28. Hanjoul P, Peeters D (1985) A comparison of two dual-based procedures for solving the p-median problem. Eur J Oper Res 20:287-396
29. Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18:1138-1162
30. Held M, Karp RM (1971) The traveling salesman problem and minimum spanning trees: part II. Math Program 1:6-25
31. Held M, Wolfe P, Crowder H (1974) Validation of subgradient optimization. Math Program 6: 62-88
32. Hogan WW, Marsten RE, Blakenship JW (1975) The boxstep method for large scale optimization. Oper Res 23:389-405
33. Karasakal O, Karasakal EK (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:1515-1526
34. Karg RL, Thompson GL (1964) A heuristic approach to solving travelling salesman problems. Manage Sci 10: 225-248
35. Klincewicz JG (1996) A dual algorithm for the uncapacitated hub location problem. Location Sci 4: 173-184
36. Klincewicz JG, Luss H (1986) A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints. J Oper Res Soc 37:495-500
37. Körkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39: 157-173
38. Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9:643-666
39. Larsson T, Patriksson M, Strömberg A-B (1996) Conditional subgradient optimization: theory and applications. Eur J Oper Res 88: 382-403
40. Marsten RE (1972) An algorithm for finding almost all of the medians of a network. Discussion Paper No. 23, Northwestern University, Evanston, Illinois
41. Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York
42. Mavrides LP (1979) An indirect method for the generalized k-median problem applied to lock box location. Manage Sci 25: 990-996
43. Mayer G, Wagner B (2002) Hub locator: an exact solution method for the multiple allocation hub location problem. Comput Oper Res 29:715-739
44. Mirchandani PB, Oudjit A, Wong RT (1985) 'Multidimensional' extensions and a nested dual approach for the m-median problem. Eur J Oper Res 21: 121-137
45. Narula SC, Ogbu UI, Samuelsson HM (1977) An algorithm for the p-median problem. Oper Res 25:709-713
46. Pirkul H (1987) Efficient algorithms for the capacitated concentrator location problem. Comput Oper Res 14: 197-208
47. Poljak BT (1967) A general method for solving extremum problems. Sov Math 8: 593-597
48. Poljak BT (1969) Minimization of unsmooth functionals. U.S.S.R. Comput Math Math Phys 9: 1429
49. Revelle CS, Marks D, Liebman JC (1970) An analysis of private and public sector location models. Manage Sci 16: 692-707
50. ReVelle CS, Swain RW (1970) Central facilities location. Geogr Anal 2:30-42
51. Sarin S, Karwan MH (1987) A computational evaluation of two subgradient search methods. Comput Oper Res 14:241-247
52. Senne ELF, Lorena LAN, Pereira MA (2005) A branch-and-price approach to p-median location problems. Comput Oper Res 32: 1655-1664
53. Shapiro JF (1979) A survey of Lagrangean techniques for discrete optimization. Ann Discrete Math 5:113-138
54. Sherali HD, Myers DC (1988) Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs. Discrete Appl Math 20:51-68
55. Sung CS, Jin HW (2001) Dual-based approach for a hub network design problem under nonrestrictive policy. Eur J Oper Res 132:88-105
56. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16:955-961
57. Wen Y-F, Lin FY-S, Kuo W-C (2007) A tree-based energy-efficient algorithm for data-centric wireless sensor networks. Proceedings of the IEEE AINA, Ontario, Canada, May 21-23, 2007, Art. No. 4220895, 202-209