✦ LIBER ✦

On the K best integer network flows

✍ Scribed by Sedeño-Noda, Antonio; Espino-Martín, Juan José

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding the K best cuts in a network

✍ Horst W. Hamacher; Jean-Claude Picard; Maurice Queyranne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 145 KB

On the efficiency of maximum-flow algori

✍ David Fernández-Baca; Charles U. Martel 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 993 KB

The k best spanning arborescences of a n

✍ P. M. Camerini; L. Fratta; F. Maffioli 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 998 KB

On the planar integer two-flow problem

✍ M. V. Lomonosov 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 570 KB

A network flow approach to the Minimum C

✍ Wenbo Zhao; Peng Zhang; Tao Jiang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 179 KB

An integer concave minimization approach

✍ R. Horst; N. V. Thoai 📂 Article 📅 1998 🏛 Springer 🌐 German ⚖ 624 KB