✦ LIBER ✦

The p maximal cover - p partial center problem on networks

✍ Scribed by Oded Berman

Book ID: 103796665
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 642 KB
Volume: 72
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90321-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The p maximal cover-p partial center pro

The p maximal cover-p partial center problem on networks : Oded Berman European Journal of Operational Research Vol. 72, 1994, pp. 432–442

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 83 KB

Duality and Distance Constraints for the

Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network

✍ B. C. Tansel, R. L. Francis, T. J. Lowe and M. L. Chen 📂 Article 📅 1982 🏛 INFORMS 🌐 English ⚖ 541 KB

On the rectangular p-center problem

✍ Zvi Drezner 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

The p-center problem involves finding the best locations for p facilities such that the furthest among n points is as close as possible to one of the facilities. Rectangular (sometimes called rectilinear, Manhattan, or 1,) distances are considered. An O ( n ) algorithm for the 1-center problem, an O

Location on Networks: A Survey. Part I:

Location on Networks: A Survey. Part I: The p-Center and p-Median Problems

✍ Barbaros C. Tansel, Richard L. Francis and Timothy J. Lowe 📂 Article 📅 1983 🏛 INFORMS 🌐 English ⚖ 366 KB

On a generalization of the p-Center Prob

On a generalization of the p-Center Problem

✍ S.O. Krumke 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Theoretical and Computational Links betw

Theoretical and Computational Links between the p-Median, Location Set-covering, and the Maximal Covering Location Problem

✍ Richard L. Church; Charles S. ReVelle 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB