Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type

European Journal of Operational Research

Volumn 115, Issue 2, 1999, Pages 285-299

  Mazzola, Joseph B ^a   Neebe, Alan W ^b  

^a DUKE UNIVERSITY   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; PROCESS CONTROL; PRODUCTION CONTROL; RELAXATION PROCESSES; STRATEGIC PLANNING;

BRANCH-AND-BOUND ALGORITHMS; CAPACITATED FACILITY LOCATIONS;

INVENTORY CONTROL;

EID: 0032670914     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00303-8     Document Type: Article

References (31)

1. Akinc, U., Khumawala, B.M., 1977. An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Science 23, 585-594.
2. Balas, E., 1965. An additive algorithm for solving linear programs with zero-one variables. Operations Research 13, 517-546.
3. Barcelo, J., Casanovas, A., 1984. A heuristic Lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research 15, 212-226.
4. Barcelo, J., Hallefjord, Å., Fernandez, E., Jörnsten, K., 1990. Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. OR Spektrum 12, 79-88.
5. Cornuéjols, G., Fisher, M.L., Nemhauser, G.L., 1977. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science 23, 789-810.
6. Efroymson, T., Ray, T., 1966. A branch bound algorithm for plant location. Operations Research 14, 361-368.
7. Erlenkotter, D., 1978. A dual-based procedure for uncapacitated warehouse location problems. Operations Research 26, 992-1009.
8. Fisher, M.L., 1981. The Lagrangian relaxation method for solving integer programming problems. Management Science 27, 1-18.
9. Fisher, M.L., 1985 An applications oriented guide to Lagrangian relaxation. Interfaces 15(2), 10-21.
10. Gavish, B., Pirkul, H., 1986. Computer and database location in distributed computing systems. IEEE Transactions on Computers 35, 583-590.
11. Geoffrion, A.M., 1974. Lagrangean relaxation for integer programming. Mathematical Programming Study 2, 82-114.
12. Geoffrion, A.M., Graves, G.W., 1974. Multicommodity distribution design by Benders decomposition. Management Science 20, 822-844.
13. Geoffrion, A.M., McBride, R., 1978. Lagrangean relaxation applied to capacitated facility location problems. AIIE Transactions 10, 40-47.
14. Goffin, J.L., 1977. On the convergence rates of subgradient optimization methods. Mathematical Programming 13, 329-347.
15. Guignard, M., Opaswongkarn, K., 1990. Lagrangian dual ascent algorithms for computing bounds in capacitated plant location problems. European Journal of Operational Research 46, 73-83.
16. Held, M.H., Wolfe, P., Crowder, H.D., 1974. Validation of subgradient optimization. Mathematical Programming 6, 62-88.
17. Jörnsten, K., Näsberg, M., 1986. A new Lagrangian relaxation approach to the generalized assignment problem. European Journal of Operational Research 27, 313-323.
18. Khumawala, B.M., 1972. An efficient branch and bound algorithm for the warehouse location problem. Management Science 18, 718-731.
19. Klincewicz, J.G., Luss, H., 1986. A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints. Journal of the Operational Research Society 37, 495-500.
20. Klincewicz, J.G. , Luss, H., 1987 A dual-based algorithm for multiproduct uncapacitated facility location. Transportation Science 21, 198-206.
21. Krarup, J., Pruzan, P.M., 1983. The simple plant location problem: Survey and synthesis. European Journal of Operational Research 12, 36-81.
22. Lee, C.Y., 1991. An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type. Computers and Operations Research 18, 167-182.
23. Lee, C.Y., 1993. A cross decomposition algorithm for a multiproduct-multitype facility location problem. Computers and Operations Research 20, 527-540.
24. Mazzola, J.B., Neebe, A.W., 1986. Resource-constrained assignment scheduling. Operations Research 34, 560-572.
25. Mazzola, J.B., Schantz, R.H., 1997. Multiple-facility loading under capacity-based economies of scope. Naval Research Logistics 44, 229-256.
26. Neebe, A.W., Rao, M.R., 1983. An algorithm for the fixed-charge assigning users to sources problem. Journal of the Operational Research Society 34, 1107-1113.
27. Nemhauser, G.L. Wolsey, L.A., 1988. Integer and Combinatorial Optimization, Wiley, New York .
28. Sridharan, R., 1995. The capacitated plant location problem. European Journal of Operational Research 87, 203-213.
29. Tempelmeier, H., Derstroff, M., 1996. A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42, 738-757.
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.