Best location of service centers in a tr
β
James McHugh; Yehoshua Perl
π
Article
π
1990
π
Elsevier Science
π
English
β 1016 KB
We consider the problem of locating service centers in a treelike network in order to maximize the serviced population under budget constraints. We show that the problem is NP-hard. In the case where the costs of establishing the service centers are equal for all n cities we obtain the maximum weigh