✦ LIBER ✦

An ε-relaxation method for separable convex cost generalized network flow problems

✍ Scribed by Paul Tseng; Dimitri P. Bertsekas

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Newton method for convex separable net

✍ John G. Klincewicz 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 782 KB

Cycle-based algorithms for multicommodit

✍ Mauricio C. de Souza; Philippe Mahey; Bernard Gendron 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

An algorithm for generating minimum cost

✍ Jeffrey L. Arthur; James O. Frendewey Jr 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 806 KB