Paper Info
Title
Multicriteria network location problems with sum objectives.
Abstract
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. (C) 1999 John Wiley & Sons, Inc.
Year
DOI
Venue
1999
10.1002/(SICI)1097-0037(199903)33:2<79::AID-NET1>3.3.CO;2-C
NETWORKS
Field
DocType
Volume
Graph theory,Mathematical optimization,Combinatorics,Lock (computer science),Lexicographical order,Single objective,Time complexity,Mathematics,Pareto principle,Special case,Tree network
Journal
33
Issue
ISSN
Citations 
2
0028-3045
15
PageRank 
References 
Authors
1.54
2
3
Name
Order
Citations
PageRank
Horst W. Hamacher156257.39
martine labbe21238108.61
Stefan Nickel342741.70