A polynomial time dual algorithm for the Euclidean multifacility location problem

• Published in: Operations research letters Vol. 18; no. 4; pp. 201 - 204
• Main Authors: Xue, G.L., Rosen, J.B., Pardalos, P.M.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.02.1996; Elsevier
• Subjects: Applied sciences; Convex programming; Exact sciences and technology; Facilities location; Flows in networks. Combinatorial problems; Operational research and scientific management; Operational research. Management science; Polynomial time algorithm; Self-concordant barrier; Facilities location; Polynomial time algorithm; Convex programming; Self-concordant barrier; Algorithms; Interior point method; Duality; Euclidean space; Location problem; Facilities; Polynomial time
• ISSN: 0167-6377; 1872-7468
• DOI: 10.1016/0167-6377(95)00050-X

The Euclidean multi-facility location (EMFL) problem is one of locating new facilities in the Euclidean space with respect to existing facilities. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportio...