The ordered anti-median problem with distances derived from a strictly convex norm

The ordered anti-median problem with distances derived from a strictly convex norm

In this paper we consider a general model for locating a repulsive facility in a bounded polygonal region. In order to have a finite set of candidates for the ordered anti-median problem, the class of strictly convex distances must be restricted. For this case an O(sn5) time algorithm is proposed, w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2013-03, Vol.161 (4-5), p.642-649
Hauptverfasser: Lozano, Antonio J., Mesa, Juan A., Plastria, Frank
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Convex distances
Facility location
Intersections
Mathematical analysis
Mathematical models
Norms
Ordered median
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we consider a general model for locating a repulsive facility in a bounded polygonal region. In order to have a finite set of candidates for the ordered anti-median problem, the class of strictly convex distances must be restricted. For this case an O(sn5) time algorithm is proposed, where s is an uniform bound on the number of intersections of two bisectors.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2012.10.015