✦ LIBER ✦

k-Partition-based facets of the network design problem

✍ Scribed by Yogesh K. Agarwal

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of the network design pro

✍ D. S. Johnson; J. K. Lenstra; A. H. G. Rinnooy Kan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB

Polyhedral structure of the 4-node netwo

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

On the uncapacitated K-commodity network

✍ Ada Suk-fung Ng; Trilochan Sastry; Janny M.Y. Leung; X.Q. Cai 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 218 KB

A characterization of the two-commodity

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

Lower bounding techniques for the degree

✍ Güvenç Şahin; Ravindra K. Ahuja 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

Exact solution of the centralized networ

✍ Fatma Gzara; Jean-Louis Goffin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB