A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems.

Satoru Fujishige Hans Röck Uwe Zimmermann

Published in: Math. Oper. Res. (1989)

Keyphrases

minimum cost
network flow problem
optimization problems
linear relaxation
np hard
minimum cost flow
network flow
evolutionary algorithm
network simplex algorithm
energy minimization
approximation algorithms
spanning tree
minimal cost
capacity constraints