The p maximal cover-p partial center problem on networks

The p maximal cover-p partial center problem on networks

0.00 Avg rating0 Votes
Article ID: iaor19971775
Country: Netherlands
Volume: 72
Issue: 2
Start Page Number: 432
End Page Number: 442
Publication Date: Jan 1994
Journal: European Journal of Operational Research
Authors:
Keywords: centre problem
Abstract:

The p maximal cover problem is to find a set of locations for p facilities so as to maximize the total demand (covered) that is at most T units away from a closest facility. The p partial center problem is to find a set of locations for the p facilities that minimizes the maximum distance between a closest facility and the demand covered. The paper shows the relationship between the two problems on networks. For a tree network with one facility it presents an algorithm to obtain all Pareto locations with respect to the two objectives: maximum cover and minimax distance. For general networks the paper discusses the p maximal cover problem requiring that the optimal solution is a Pareto location.

Reviews

Required fields are marked *. Your email address will not be published.