An algorithm for the min concave cost flow problem

https://doi.org/10.1016/0377-2217(80)90109-5Get rights and content

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.

References (8)

  • N. Christofides

    Graph Theory: An Algorithmic Approach

    (1975)
  • C. Ciaponi et al.

    Definizione della funzione economica da minimizzare nei problemi di ottimizzazione degli scarichi

    Ingegneria Ambientale

    (1976)
  • G. Gallo et al.

    Adjacent extreme flows and application to min concave cost flow problems

    Networks

    (1979)
  • R.M. Soland

    Optimal facility location with concave costs

    Operations Res.

    (1974)
There are more references available in the full text version of this article.

Cited by (0)

View full text