✦ LIBER ✦

Polynomial-time primal simplex algorithms for the minimum cost network flow problem

✍ Scribed by Donald Goldfarb; Jianxiu Hao

Publisher: Springer
Year: 1992
Tongue: English
Weight: 882 KB
Volume: 8
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01758840

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simplex algorithm for minimum-cost net

A simplex algorithm for minimum-cost network-flow problems in infinite networks

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

A bad network problem for the simplex me

A bad network problem for the simplex method and other minimum cost flow algorithms

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

New polynomial-time cycle-canceling algo

New polynomial-time cycle-canceling algorithms for minimum-cost flows

✍ P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

Parallel primal-dual methods for the min

Parallel primal-dual methods for the minimum cost flow problem

✍ Dimitri P. Bertsekas; David A. Castañon 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 1008 KB

A deterministic annealing algorithm for

A deterministic annealing algorithm for the minimum concave cost network flow problem

✍ Chuangyin Dang; Yabin Sun; Yuping Wang; Yang Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 292 KB

The existing algorithms for the minimum concave cost network flow problems mainly focus on the singlesource problems. To handle both the single-source and the multiple-source problem in the same way, especially the problems with dense arcs, a deterministic annealing algorithm is proposed in this pap

On strongly polynomial variants of the n

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem

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