Premium
Multicriteria network location problems with sum objectives
Author(s) -
Hamacher Horst W.,
Labbé Martine,
Nickel Stefan
Publication year - 1999
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199903)33:2<79::aid-net1>3.0.co;2-l
Subject(s) - lexicographical order , mathematical optimization , pareto principle , generalization , pareto optimal , multi objective optimization , computer science , node (physics) , tree network , dominance (genetics) , mathematics , algorithm , combinatorics , time complexity , engineering , mathematical analysis , biochemistry , chemistry , structural engineering , gene
In this paper, network location problems with several objectives are discussed, where every single objective is a classical median objective function. We will look 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 multicriteria problems are developed. In the special case of a tree network, a generalization of Goldman's dominance algorithm for finding Pareto locations is presented. © 1999 John Wiley & Sons, Inc. Networks 33: 79–92, 1999