On strongly polynomial dual simplex algorithms for the maximum flow problem.

Donald Goldfarb Wei Chen

Published in: Math. Program. (1997)

Keyphrases

simplex algorithm
computational complexity
optimization problems
test problems
primal dual
minimum cost flow
lower bound
evolutionary algorithm
multi objective
linear programming
genetic programming
particle swarm optimization
efficient solutions
interior point
strongly polynomial