## Multicriteria network location problems with sumb objectives

• In this paper network location problems with several objectives are discussed, where every single objective is a classical median objective function. We will lock at the problem of finding Pareto optimal locations and lexicographically optimal locations. It is shown that for Pareto optimal locations in undirected networks no node dominance result can be shown. Structural results as well as efficient algorithms for these multi-criteria problems are developed. In the special case of a tree network a generalization of Goldman's dominance algorithm for finding Pareto locations is presented.

### Additional Services

Author: Horst W. Hamacher, Stefan Nickel, Martine Labbe urn:nbn:de:hbz:386-kluedo-4569 Report in Wirtschaftsmathematik (WIMA Report) (15) Preprint English 1999 1999 Technische Universität Kaiserslautern Fachbereich Mathematik 510 Mathematik

$Rev: 12793$