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)O(sn5) time algorithm is proposed, where ss is an uniform bound on the number of intersections of two bisectors.