Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem

DOI10.1287/ijoc.3.3.207zbMath0753.90039OpenAlexW2129311007MaRDI QIDQ4015381

Guoliang Xue, J. Ben Rosen

Publication date: 13 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.3.3.207

zbMATH Keywords

hypercubecomputational comparisonsNewton's algorithmEuclidean single facility locationWeiszfeld's algorithm

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An approach for solving competitive location problems with variable demand using multicore systems, Heuristic solution of the multisource Weber problem as a \(p\)-median problem