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

1-1-1991

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 fc-domination problem. An 0(nk²) dynamic programming procedure is given. Then an 0(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. © 1991, Elsevier Inc. All rights reserved.

Identifier

77957072809 (Scopus)

Publication Title

Annals of Discrete Mathematics

External Full Text Location

https://doi.org/10.1016/S0167-5060(08)71050-1

ISSN

01675060

First Page

199

Last Page

214

Issue

C

Volume

48

Recommended Citation

Mchugh, James and Perl, Yehoshua, "Best Location of Service Centers in a Treelike Network Under Budget Constraints" (1991). Faculty Publications. 17552.
https://digitalcommons.njit.edu/fac_pubs/17552