✦ LIBER ✦

An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

✍ Scribed by R. Horst; N. V. Thoai

Publisher: Springer
Year: 1998
Tongue: German
Weight: 624 KB
Volume: 20
Category: Article
ISSN: 0171-6468
DOI: 10.1007/bf01545530

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lagrangean heuristic for the capacitat

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

✍ Torbjörn Larsson; Athanasios Migdalas; Mikael Rönnqvist 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB

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