Facility Location on a Sphere

DOI10.2307/3009474zbMath0426.90020OpenAlexW4249291548MaRDI QIDQ3863653

George O. Wesolowsky, Zvi Drezner

Publication date: 1978

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3009474

zbMATH Keywords

Weber problemlogisticsfacility location on a sphereiterative heuristic method

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (11)

On an open problem in spherical facility location ⋮ Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993 ⋮ Solution of an equiweighted minimax location problem on a hemisphere ⋮ An efficient heuristic for the \(k\)-partitioning problem ⋮ On min-max \(r\)-gatherings ⋮ On the convergence of a modified algorithm for the spherical facility location problem ⋮ Minimal length tree networks on the unit sphere ⋮ 2-facility manifold location routing problem ⋮ Spherical minimax location problem using the Euclidean norm: Formulation and optimization ⋮ A polynomial time algorithm for a hemispherical minimax location problem ⋮ A globally convergent algorithm for facility location on a sphere

This page was built for publication: Facility Location on a Sphere