Istituto di Scienza e Tecnologie dell'Informazione     
Gallo G., Sandi C., Sodini C. An algorithm for the min concave cost flow problem. In: European Journal Operational Research, vol. 4 (4) pp. 248 - 255. North-Holland Publishing Company, 1980.
A method is presented to solve that class of network flow problems, which may be formulated as one source multiple destination minimum cost flow problems with concave costs. The global optimum is searched using a branch and bound procedure, in which the enumeration scheme is based on a characterization of the optimal solution set, while linear relaxations of the original problem provide lower bounds.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional