✦ LIBER ✦

The continuous m-center problem on a network

✍ Scribed by Gabriel Y. Handler; Margalit Rozman

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 651 KB
Volume: 15
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230150205

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

The absolute center of a network

✍ Dov Dvir; Gabriel Y. Handler 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

The generalized P-forest problem on a tr

The generalized P-forest problem on a tree network

✍ Arie Tamir; Timothy J. Lowe 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 665 KB

The continuous p-median of a network

✍ Pierre Hansen; Martine Labbé 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

Restricted delivery problems on a networ

Restricted delivery problems on a network

✍ Arkin, Esther M.; Hassin, Refael; Klein, Limor 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

We consider a delivery problem on a network in which nodes have supplies or demands for certain products and arcs have lengths satisfying the triangle inequality. A vehicle of infinite capacity travels through the network, carrying products to their destinations, and is limited in that it can carry