𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the min concave cost flow problem

✍ Scribed by Giorgio Gallo; Claudio Sandi; Claudio Sodini

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
696 KB
Volume
4
Category
Article
ISSN
0377-2217

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

An exact algorithm for the concave trans
An exact algorithm for the concave transportation problem
✍ Leon Cooper; Mary W. Cooper πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 810 KB

## AbstractAn exact method for solving a class of concave transportation problems which reflect economies of scale is presented. By exploiting concepts of dynamic programming and an analysis of the nature of the recursion, an analytic representation of the optimal allocation at each stage has been