An algorithm for the min concave cost flow problem |
| |
Authors: | Giorgio Gallo Claudio Sandi Claudio Sodini |
| |
Institution: | Istituto di Elaborazione dell''Informazione, CNR, Pisa, Italia;Centro Scientifico IBM, Pisa, Italia;Istituto di Scienze dell''Informatiozione, Università di Pisa, Pisa, Italia |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|