✦ LIBER ✦

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

✍ Scribed by Andrew V. Goldberg; Michael D. Grigoriadis; Robert E. Tarjan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On strongly polynomial variants of the n

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A simplex algorithm for minimum-cost net

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

Visualization software of the network ex

✍ D. Andreou; K. Paparrizos; N. Samaras; A. Sifaleras 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 448 KB

A bad network problem for the simplex me

✍ Norman Zadeh 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 489 KB

A neural network model and algorithm for

✍ Lixin Tang; Wenxin Liu; Jiyin Liu 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 326 KB

A primal simplex algorithm that solves t

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 684 KB