✦ LIBER ✦

Parallel algorithms for the assignment and minimum-cost flow problems

✍ Scribed by James B. Orlin; Clifford Stein

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 429 KB
Volume: 14
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(93)90068-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An infeasibility pricing algorithm for t

An infeasibility pricing algorithm for the multicommodity minimum cost flow problem

✍ Mokhtar S. Bazaraa 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 837 KB

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 parallel algorithm for the minimum wei

A parallel algorithm for the minimum weighted vertex cover problem

✍ Aristidis Likas; Andreas Stafylopatis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 522 KB

An algorithm for generating minimum cost

An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions

✍ Jeffrey L. Arthur; James O. Frendewey Jr 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 806 KB

An algorithm for the min concave cost fl

An algorithm for the min concave cost flow problem

✍ Giorgio Gallo; Claudio Sandi; Claudio Sodini 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 KB

Heuristic solutions for general concave

Heuristic solutions for general concave minimum cost network flow problems

✍ Dalila B.M.M. Fontes; José Fernando Gonçalves 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We address the single‐source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be N