Heuristic solutions for general concave minimum cost network flow problems.

Dalila B. M. M. Fontes José Fernando Gonçalves

Published in: Networks (2007)

Keyphrases

minimum cost
network flow problem
network simplex algorithm
network flow
np hard
special case
minimal cost
approximation algorithms
polynomially solvable
network design problem
spanning tree
mixed integer
capacity constraints
computational complexity
lower bound
minimum cost flow