✦ LIBER ✦

On minimum reload cost paths, tours, and flows

✍ Scribed by Edoardo Amaldi; Giulia Galbiati; Francesco Maffioli

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on minimum cost convex flows

✍ D. L. Adolphson 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

Minimum-cost flows in convex-cost networ

✍ T. C. Hu 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

Minimum-cost dynamic flows: The series-p

✍ Bettina Klinz; Gerhard J. Woeginger 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

New polynomial-time cycle-canceling algo

✍ P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

Flows on few paths: Algorithms and lower

✍ Maren Martens; Martin Skutella 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

Algorithms for minimum-cost paths in tim

✍ Brian C. Dean 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB