Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow.

Thomas R. Ervolina S. Thomas McCormick

Published in: Discret. Appl. Math. (1993)

Keyphrases

minimum cost flow
computational complexity
significant improvement
simulated annealing
computationally efficient
image segmentation
optimization problems
particle swarm optimization
tabu search