✦ LIBER ✦

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

✍ Scribed by Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin

Publisher: Springer
Year: 2004
Tongue: English
Weight: 289 KB
Volume: 39
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1085-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 particle swarm optimization-based hybr

A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems

✍ Shangyao Yan; Yu-Lin Shih; Wang-Tsang Lee 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 311 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

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 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