Drezner, Zvi The p-centre problem - heuristic and optimal algorithms. (English) Zbl 0544.90024 J. Oper. Res. Soc. 35, 741-748 (1984). For the weighted Euclidean version of the p-centre problem, a standard problem in location theory, two approximation algorithms and an optimization algorithm that requires polynomial time for fixed p are presented. Reviewer: J.K.Lenstra Cited in 32 Documents MSC: 90B05 Inventory, storage, reservoirs Keywords:location; set covering; weighted Euclidean version; p-centre problem; approximation algorithms; polynomial time PDF BibTeX XML Cite \textit{Z. Drezner}, J. Oper. Res. Soc. 35, 741--748 (1984; Zbl 0544.90024) Full Text: DOI OpenURL