A specialized network simplex algorithm for the constrained maximum flow problem.

Published in: Eur. J. Oper. Res. (2011)

Keyphrases

network simplex algorithm
simplex algorithm
linear programming
primal dual
randomly generated
network flow problem
minimum cost
minimal cost
linear programming problems
linear program
feasible solution
simplex method
minimum cost flow
computational complexity
worst case
traveling salesman problem