| Article ID: | iaor19961538 |
| Country: | Netherlands |
| Volume: | 66 |
| Issue: | 3 |
| Start Page Number: | 305 |
| End Page Number: | 312 |
| Publication Date: | May 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Sridharan R. |
| Keywords: | bin packing |
This paper looks at the Lagrangian relaxations of the Capacitated Plant Location Problem with Single Source constraints in terms of the bounds and solution techniques. It proposes a heuristic based on a Lagrangian relaxation of the problem. The paper also shows how this heuristic can be used to solve other combinatorial problems that are related to this problem, such as the concentrator location problem and the bin packing problem.