✦ LIBER ✦

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

✍ Scribed by Norman Zadeh

Publisher: Springer-Verlag
Year: 1973
Tongue: English
Weight: 489 KB
Volume: 5
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580132

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

Polynomial-time primal simplex algorithm

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

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

Visualization software of the network ex

Visualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem

✍ D. Andreou; K. Paparrizos; N. Samaras; A. Sifaleras 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 448 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

Parallel algorithms for the assignment a

Parallel algorithms for the assignment and minimum-cost flow problems

✍ James B. Orlin; Clifford Stein 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 429 KB

A Lagrangean heuristic for the capacitat

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

✍ Torbjörn Larsson; Athanasios Migdalas; Mikael Rönnqvist 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB