𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum-cost flows in convex-cost networks

✍ Scribed by T. C. Hu

Publisher
John Wiley and Sons
Year
1966
Tongue
English
Weight
369 KB
Volume
13
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on minimum cost convex flows
A note on minimum cost convex flows
✍ D. L. Adolphson πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 92 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

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