Hindi, K. S.; Pieńkosz, K. Efficient solution of large scale, single-source, capacitated plant location problems. (English) Zbl 1054.90588 J. Oper. Res. Soc. 50, No. 3, 268-274 (1999). Summary: The single-source, capacitated plant location problem is considered. This problem differs from the capacitated plant location problem by the additional requirement that each customer must be supplied with all its demand from a single plant. An efficient heuristic solution, capable of solving large problem instances, is presented. The heuristic combines Lagrangian relaxation with restricted neighbourhood search. Computational experiments on two sets of problem instances are presented. Cited in 16 Documents MSC: 90B85 Continuous location 90C59 Approximation methods and heuristics in mathematical programming Keywords:location; Lagrangian relaxation; restricted neighbourhood search Software:OR-Library PDFBibTeX XMLCite \textit{K. S. Hindi} and \textit{K. Pieńkosz}, J. Oper. Res. Soc. 50, No. 3, 268--274 (1999; Zbl 1054.90588) Full Text: DOI