𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

✍ Scribed by Torbjörn Larsson; Athanasios Migdalas; Mikael Rönnqvist

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
684 KB
Volume
78
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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