𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for a concave production cost network flow problem

✍ Scribed by Yasutoshi Yajima; Hiroshi Konno


Publisher
Japan Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
1005 KB
Volume
16
Category
Article
ISSN
0916-7005

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A deterministic annealing algorithm for
✍ 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