### Refine

#### Year of publication

- 1999 (2)

#### Document Type

- Preprint (2)

#### Language

- English (2)

#### Has Fulltext

- yes (2)

#### Is part of the Bibliography

- no (2)

#### Keywords

- Algebraic Optimization (1)
- Bisector (1)
- Geometrical Algorithms (1)
- Location Theory (1)
- Multicriteria Optimization (1)
- Voronoi diagram (1)
- convex distance funtion (1)
- gauge (1)
- location problem (1)
- norm (1)

#### Faculty / Organisational entity

In this paper we deal with the determination of the whole set of Pareto-solutions of location problems with respect to Q general criteria. These criteria include as particular instances median, center or cent-dian objective functions. The paper characterizes the set of Pareto-solutions of all these multicriteria problems. An efficient algorithm for the planar case is developed and its complexity is established. the proposed approach is more general than the previously published approaches to multicriteria location problems and includes almost all of them as particular instances.

Let rC and rD be two convexdistance funtions in the plane with convex unit balls C and D. Given two points, p and q, we investigate the bisector, B(p,q), of p and q, where distance from p is measured by rC and distance from q by rD. We provide the following results. B(p,q) may consist of many connected components whose precise number can be derived from the intersection of the unit balls, C nd D. The bisector can contain bounded or unbounded 2-dimensional areas. Even more surprising, pieces of the bisector may appear inside the region of all points closer to p than to q. If C and D are convex polygons over m and m vertices, respectively, the bisector B(p,q) can consist of at most min(m,n) connected components which contain at most 2(m+n) vertices altogether. The former bound is tight, the latter is tight up to an additive constant. We also present an optimal O(m+n) time algorithm for computing the bisector.