New polynomial-time cycle-canceling algorithms for minimum-cost flows.

P. T. Sokkalingam Ravindra K. Ahuja James B. Orlin

Published in: Networks (2000)

Keyphrases

minimum cost
computational complexity
worst case
approximation algorithms
linear programming
minimum cost flow
evolutionary algorithm
np hard
mobile robot
network flow
capacity constraints