A new scaling algorithm for the minimum cost network flow problem.
Donald GoldfarbZhiying JinPublished in: Oper. Res. Lett. (1999)
Keyphrases
- minimum cost
- network flow problem
- np hard
- network flow
- network simplex algorithm
- minimal cost
- spanning tree
- computational complexity
- approximation algorithms
- randomly generated
- linear programming
- dynamic programming
- search space
- lower bound
- combinatorial optimization
- convergence rate
- upper bound
- mixed integer
- minimum cost flow
- search algorithm