✦ LIBER ✦

Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem

✍ Scribed by P. Beraldi; F. Guerriero; R. Musmanno

Book ID: 110267566
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 263 KB
Volume: 18
Category: Article
ISSN: 0926-6003
DOI: 10.1023/a:1008778622003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Minimum cost flow algorithms for series-

Minimum cost flow algorithms for series-parallel networks

✍ Wolfgang W. Bein; Peter Brucker; Arie Tamir 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 439 KB

An algorithm for the quadratic cost mini

An algorithm for the quadratic cost minimum cost flow problems

✍ Azuma Ouchi; Ikuo Kaji; Hirosaki Sawato 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 482 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

Solving the undirected minimum cost flow

Solving the undirected minimum cost flow problem with arbitrary costs

✍ A. Sedeño-Noda; C. González-Martín; S. Alonso 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB

## Abstract We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This sit

A hybrid algorithm for solving convex se

A hybrid algorithm for solving convex separable network flow problems

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