✦ LIBER ✦

The complexity of the network design problem

✍ Scribed by D. S. Johnson; J. K. Lenstra; A. H. G. Rinnooy Kan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of resilient network d

✍ Artur Tomaszewski; Michał Pióro; Mateusz Żotkiewicz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB

Complexity of the minimum-dummy-activiti

✍ M. S. Krishnamoorthy; N. Deo 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

A characterization of the two-commodity

✍ Trilochan Sastry 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

k-Partition-based facets of the network

✍ Yogesh K. Agarwal 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

Polyhedral structure of the 4-node netwo

✍ Yogesh K. Agarwal 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

On the computational complexity of the m

✍ Maciej M. Syslo 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB