✦ LIBER ✦

THE COMPUTATIONAL COMPLEXITY OF THE PROBLEM OF DETERMINING LEAST CAPITAL COST DESIGNS FOR WATER SUPPLY NETWORKS

✍ Scribed by YATES, D. F.; TEMPLEMAN, A. B.; BOFFEY, T. B.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on the computational complexity of

✍ Ulrich Faigle; Walter Kern; Daniël Paulusma 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 129 KB

Analysis of the linear programming gradi

✍ Kessler, Avner; Shamir, Uri 📂 Article 📅 1989 🏛 American Geophysical Union 🌐 English ⚖ 974 KB

The CAT metaheuristic for the solution o

✍ Carle, Marc-André; Martel, Alain; Zufferey, Nicolas 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 676 KB

A critical study of the linear programmi

✍ Bhave, Pramod R.; Sonak, Vilas V. 📂 Article 📅 1992 🏛 American Geophysical Union 🌐 English ⚖ 691 KB

Partially constrained ant colony optimiz

✍ M.H. Afshar 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Design and Development of Low Cost, Simp

✍ Cherukuri, Jyotsna; Anjaneyulu, Y. 📂 Article 📅 2005 🏛 MDPI AG 🌐 English ⚖ 187 KB