✦ LIBER ✦

A polynomial algorithm for minimum quadratic cost flow problems

✍ Scribed by M. Minoux

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the quadratic cost mini

✍ Azuma Ouchi; Ikuo Kaji; Hirosaki Sawato 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

Polynomial-time primal simplex algorithm

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 882 KB

A Strongly Polynomial Cut Canceling Algo

✍ Iwata, Satoru; McCormick, S. Thomas; Shigeno, Maiko 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 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

A strongly polynomial minimum cost circu

✍ Éva Tardos 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 459 KB

Polynomial algorithms for a class of min

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