Algorithms for path medi-centers of a tree

We consider the problem of finding an optimal location of a path on a tree, using combinations of minisum and minimax criteria (which are respectively maximal distance and average distance from the path to customers situated at the vertices). The case of linear combination of the two criteria and th...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 26; no. 14; pp. 1395 - 1409
Main Authors Averbakh, Igor, Berman, Oded
Format Journal Article
LanguageEnglish
Published New York Elsevier Ltd 01.12.1999
Pergamon Press Inc
Subjects
Algorithms
Computer networks
Location analysis
Studies
Online AccessGet full text
ISSN0305-0548
1873-765X
0305-0548
DOI10.1016/S0305-0548(99)00042-8

Cover

More Information
Summary:We consider the problem of finding an optimal location of a path on a tree, using combinations of minisum and minimax criteria (which are respectively maximal distance and average distance from the path to customers situated at the vertices). The case of linear combination of the two criteria and the case where one criterion is optimized subject to a restriction on the value of the other are considered and linear-time algorithms for these problems are presented. It is proved that the representation of the set of Pareto-optimal paths in the space of criteria has cardinality not greater than n−1, where n is the number of vertices of the tree, and can be obtained in O(n log n) time, although the number of Pareto-optimal paths can be O( n 2)
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/S0305-0548(99)00042-8