An algorithm for Weber's problem on the sphere

DOI10.1016/0966-8349(95)00017-8zbMath0915.90182OpenAlexW2082119219MaRDI QIDQ4229654

Brigitte Jaumard, Pierre Hansen, Stéphane Krau

Publication date: 22 February 1999

Published in: Location Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0966-8349(95)00017-8

zbMATH Keywords

global optimizationspherebranch-and-boundlower boundshemisphereminisumWeber's problem

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)

Related Items (4)

Asymmetric distance location model ⋮ Obnoxious facility location in multiple dimensional space ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ A polynomial time algorithm for a hemispherical minimax location problem

This page was built for publication: An algorithm for Weber's problem on the sphere