| Article ID: | iaor1992458 |
| Country: | United Kingdom |
| Volume: | 42 |
| Issue: | 7 |
| Start Page Number: | 579 |
| End Page Number: | 585 |
| Publication Date: | Jul 1991 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Sridharan R. |
| Keywords: | heuristics |
The paper presents a Lagrangian relaxation-based heuristic for solving the capacitated plant-location problem with side constraints. The side constraints are upper-bound constraints on disjoint subsets of the (0-1) variables. Computational results are reported for some problems, having been obtained both on a mainframe computer and on a personal computer.