✦ LIBER ✦

Minimum cost flow algorithms for series-parallel networks

✍ Scribed by Wolfgang W. Bein; Peter Brucker; Arie Tamir

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for the assignment a

✍ James B. Orlin; Clifford Stein 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Minimum-cost dynamic flows: The series-p

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

A least-squares minimum-cost network flo

✍ Balaji Gopalakrishnan; Seunghyun Kong; Earl Barnes; Ellis L. Johnson; Joel S. So 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 795 KB

A simplex algorithm for minimum-cost net

✍ Thomas C. Sharkey; H.Edwin Romeijn 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

On dual minimum cost flow algorithms

✍ Jens Vygen 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 280 KB

Sequential and parallel algorithms for m

✍ Eleonor Ciurea; Laura Ciupalâ 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 193 KB