Login / Signup
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem.
Konstantinos Paparrizos
Nikolaos Samaras
Angelo Sifaleras
Published in:
Comput. Oper. Res. (2009)
Keyphrases
</>
minimum cost
network flow problem
np hard
network simplex algorithm
network flow
simplex algorithm
approximation algorithms
dynamic programming
network design problem
optimal solution
minimal cost
worst case
spanning tree
linear programming
randomly generated
linear program
minimum cost flow
objective function
convergence rate
mixed integer
simplex method
evolutionary algorithm
computational complexity