A branch and bound algorithm for an uncapacitated facility location problem with a side constraint

International Transactions in Operational Research

Volumn 5, Issue 2, 1998, Pages 155-168

  Klose, A ^a  

^a UNIVERSITY OF ST GALLEN   (Switzerland)

Author keywords

Branch and Bound; Facility location; Lagrangean relaxation

Indexed keywords

EID: 0342397495     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1998.tb00111.x     Document Type: Article

References (31)

1. Barcelo, J., Hallefjord, Å., Fernandez, E. and Jörnsten, K. (1990) Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing: OR Spektrum 12, 79-88.
2. Beasley, J. E. (1988) An algorithm for solving large capacitated warehouse location problems. European Journal of Operational Research 33, 314-325.
3. Beasley, J. E. (1990) OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41, 1069-1072.
4. Bilde, O. and Krarup, J. (1977) Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics 1, 79-97.
5. Caprara. A. and Salazar, J. J. (1996) A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem. TOP 4, 135-163.
6. Christofides, N. and Beasley, J. E. (1982) A tree search algorithm for the p-median problem. European Journal of Operational Research 10, 196-204.
7. Christofides, N. and Beasley, J. E. (1983) Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem. European Journal of Operational Research 12, 19-28.
8. Cornuejols, G., Fisher, M. L. and Nemhauser, G. L. (1977) Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science 23, 163-177.
9. Cornuejols. G. and Thizy, J.-M. (1982) Some facets of the simple plant location polytope. Mathematical Programming 23, 50-74.
10. Cornuejols, G., Sridharan, R. and Thizy, J.-M. (1991) A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 50, 280-297.
11. Darby-Dowman, K. and Lewis, H. S. (1988) Lagrangian relaxation and the single-source capacitated facility-location problem. Journal of the Operational Research Society 39, 1035-1040.
12. Erlenkotter, D. (1978) A dual-based procedure for uncapacitated facility location: Operations Research 26, 992-1009.
13. Feldman, E., Lehrer, F. A. and Ray, T. L. (1966) Warehouse location under continuous economies of scale. Management Science 12, 670-684.
14. Fisher, M. L. and Hochbaum, D. S. (1980) Database location in computer networks. Journal of the ACM 7, 718-735.
15. Galvao, R. D. and Raggi, L. A. (1989) A method of solving to optimality uncapacitated location problems. Annals of Operations Research 18, 225-244.
16. Geoffrion, A. M. and Graves, G. W. (1974) Multicommodity distribution system design by Benders decomposition. Management Science 20, 822-844.
17. Gu, Z., Nemhauser, G. L. and Savelsbergh, M. W. P. (1995) Lifted cover inequalities for 0-1 linear programs: Computation. Report 94-09, Logistic Optimization Center, Georgia Institute of Technology.
18. Hanjoul, P. and Peeters, D. (1985) A comparison of two dual-based procedures for solving the p-median problem. European Journal of Operational Research 20, 387-396.
19. Klincewicz, J. G. and Luss, H. (1986) A Lagrangian relaxation heuristic for capacitated facility location with single source constraints. Journal of the Operational Research Society 37, 495-500.
20. Klose, A. (1993) Das kombinatorische P-Median-Modell und Erweiterungen zur Bestimmung optimaler Standorte. PhD thesis Nr. 1464, University of St. Gallen.
21. Klose, A. (1997) Obtaining sharp lower and upper bounds for two-stage capacitated facility location problems. To appear in Advances in Distribution Logistics.
22. Kuehn, A. A. and Hamburger, M. J. (1963) A heuristic program for locating warehouses. Management Science 9, 643-666.
23. Martello, S. and Toth, P. (1977) An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European Journal of Operational Research 1, 169-175.
24. Martello, S. and Toth, P. (1990) Knapsack Problems—Algorithms and Computer Implementations. Wiley-Interscience series in discrete mathematics and optimization. Chichester New York: Wiley.
25. Mulvey, J. M. and Crowder, H. P. (1979) Cluster analysis: An application of Lagrangean relaxation. Management Science 25, 329-340.
26. Narula, S. D., Ogbu, U. I. and Samuelsson, H. M. (1977) An algorithm for the p-median problem: Operations Research 25, 709-713.
27. Ryu, C. and Guignard, M. (1992) An efficient algorithm for the capacitated plant location problem. Working Paper 92-11-02, University of Pennsylvania, Decision Sciences Department.
28. Sridharan, R. (1995) The capacitated plant location problem. European Journal of Operational Research 87, 203-213.
29. Teitz, M. B. and Bart, P. (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph: Operations Research 16, 955-961.
30. Van Roy, T. J. (1983) Cross decomposition for mixed integer programming. Mathematical Programming 25, 46-63.
31. Van Roy, T. J. (1986) A cross decomposition algorithm for capacitated facility location: Operations Research 34, 145-163.