✦ LIBER ✦

An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems

✍ Scribed by Bertsekas, Dimitri P.; Polymenakos, Lazaros C.; Tseng, Paul

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An ε-relaxation method for separable con

✍ Paul Tseng; Dimitri P. Bertsekas 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 181 KB

A Partitioned ∈-Relaxation Algorithm for

✍ Renato De Leone; Robert R. Meyer; Armand Zakarian 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 96 KB

A Newton method for convex separable net

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

A hybrid algorithm for solving convex se

✍ Katharina Belling-Seib 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 854 KB

Relaxation methods for problems with str

✍ Paul Tseng; Dimitri P. Bertsekas 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 734 KB

Implementation and Test of Auction Metho

✍ F. Guerriero; P. Tseng 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 260 KB