Minimum cost flows with minimum quantities.

Sven Oliver Krumke Clemens Thielen

Published in: Inf. Process. Lett. (2011)

Keyphrases

minimum cost
np hard
approximation algorithms
spanning tree
network flow
network flow problem
network simplex algorithm
capacity constraints
multi objective
undirected graph
minimum cost flow
lower bound
special case
weighted sum
edit operations