| Article ID: | iaor19981583 |
| Country: | Netherlands |
| Volume: | 87 |
| Issue: | 2 |
| Start Page Number: | 203 |
| End Page Number: | 213 |
| Publication Date: | Dec 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | Sridharan R. |
| Keywords: | heuristics, programming: branch and bound |
This paper provides a review of the various solution methods for the capacitated plant location problem. Heuristic and exact procedures, that have appeared in the literature, are covered. The review also examines two innovative concepts, the Lagrangian heuristic and variable splitting, as proposed for the capacitated plant location problem.