Spherical Minimax Location Problem

Spherical Minimax Location Problem

This paper presents an algorithm for determining a minimax location to service demand points that are equally weighted and distributed over a sphere. The norm under consideration is geodesic. The algorithm presented here is based on enumeration and has a polynomial time complexity. [PUBLICATION ABST...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational optimization and applications 2001-03, Vol.18 (3), p.311-311
Hauptverfasser: Das, P, Chakraborti, N R, Chaudhuri, P K
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Geometry
Optimization
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an algorithm for determining a minimax location to service demand points that are equally weighted and distributed over a sphere. The norm under consideration is geodesic. The algorithm presented here is based on enumeration and has a polynomial time complexity. [PUBLICATION ABSTRACT]
ISSN:0926-6003
1573-2894
DOI:10.1023/A:1011248622793