✦ LIBER ✦

A strongly polynomial minimum cost circulation algorithm

✍ Scribed by Éva Tardos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Strongly Polynomial Cut Canceling Algo

✍ Iwata, Satoru; McCormick, S. Thomas; Shigeno, Maiko 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 KB

Note on Weintraub’s Minimum-Cost Circula

✍ Barahona, Francisco; Tardos, éva 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 626 KB

A polynomial algorithm for minimum quadr

✍ M. Minoux 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 739 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

Polynomial algorithms for a class of min

✍ Takahito Kuno 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 123 KB

A new strongly polynomial dual network s

✍ Ronald D. Armstrong; Zhiying Jin 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 909 KB