Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees

Bhattacharya, Binay; Hu, Yuzhuang; Shi, Qiaosheng; Tamir, Arie

doi:10.1007/11940128_39

Cited by 2 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The vertex v 4 is considered as the middle vertex of T since removing v 4 (see Fig. 3) leads to three subtrees with maximum cardinality 3 ≤ 7 2 .…”

Section: Median Path Of a Treementioning

confidence: 99%

“…Most of papers study the problem of locating a path on a tree which minimizes either the sum of weighted distances from all vertices to the path (median criterion) or minimizes the maximum weighted distance from the vertices to the path (the center criterion). The path which satisfies the first criterion is called a median path [4,5,19,20,22,34], and the path which satisfies the second criterion is called a central path [1,2,7,28,33]. The median criterion is used to reduce the total cost of the service systems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An algorithm for solving the bi-objective median path-shaped facility on a tree network

Aboutahoun

El-Safty

2020

J Egypt Math Soc

View full text Add to dashboard Cite

In this paper, an algorithm for the bi-objective median path (BMP) problem on a tree network is considered. The algorithm is based on the two-phase method which can compute all Pareto solutions for the BMP problem. The first phase is applied to find supported Pareto solutions by solving the uni-objective problem D(P, λ). The second phase is used to compute the unsupported Pareto solutions by applying a k-best algorithm which computes the k-best Pareto solutions in order of their objective values.

show abstract

“…The vertex v 4 is considered as the middle vertex of T since removing v 4 (see Fig. 3) leads to three subtrees with maximum cardinality 3 ≤ 7 2 .…”

Section: Median Path Of a Treementioning

confidence: 99%