Best location of service centers in a treelike network under budget constraints

Authors

James McHugh, New Jersey Institute of Technology
Yehoshua Perl, New Jersey Institute of Technology

Document Type

Article

Publication Date

12-14-1990

Abstract

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 weight k-domination problem. An O(nk²) dynamic programming procedure is given. Then an O(nB²) pseudo-polynomial dynamic programming procedure is presented for the original problem, where B is the budget constraint. Finally a variation of the new left-right dynamic programming technique is applied to obtain a more efficient pseudo-polynomial procedure. © 1990.

Identifier

38249017853 (Scopus)

Publication Title

Discrete Mathematics

External Full Text Location

https://doi.org/10.1016/0012-365X(90)90361-K

ISSN

0012365X

First Page

199

Last Page

214

Issue

1-3

Volume

86

Recommended Citation

McHugh, James and Perl, Yehoshua, "Best location of service centers in a treelike network under budget constraints" (1990). Faculty Publications. 17658.
https://digitalcommons.njit.edu/fac_pubs/17658