✦ LIBER ✦

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

✍ Scribed by B. C. Tansel, R. L. Francis, T. J. Lowe and M. L. Chen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the distance c

✍ Arie Tamir 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

The generalized P-forest problem on a tr

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

A dynamic programming algorithm for the

✍ Jennifer A. Horne; J. Cole Smith 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

Location on Networks: A Survey. Part I:

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

An $O ( ( n\log p )^2 )$ Algorithm for t

✍ Chandrasekaran, R.; Tamir, A. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 776 KB

A remark on the existence and multiplici

✍ G. A. Afrouzi; S. H. Rasouli 📂 Article 📅 2009 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 228 KB