𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems

✍ Scribed by Shangyao Yan; Yu-Lin Shih; Wang-Tsang Lee

Publisher
Springer US
Year
2010
Tongue
English
Weight
311 KB
Volume
49
Category
Article
ISSN
0925-5001

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