𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Concave minimum cost network flow problems solved with a colony of ants

✍ Scribed by Marta S. R. Monteiro,Dalila B. M. M. Fontes…

Book ID
126355777
Publisher
Springer US
Year
2012
Tongue
English
Weight
935 KB
Volume
19
Category
Article
ISSN
1381-1231

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