A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Ravindra K. AhujaDorit S. HochbaumJames B. OrlinPublished in: Algorithmica (2004)
Keyphrases
- minimum cost
- network flow problem
- np hard
- network flow
- network simplex algorithm
- minimal cost
- spanning tree
- dynamic programming
- computational complexity
- worst case
- approximation algorithms
- minimum cost flow
- network design problem
- linear programming
- mixed integer
- simulated annealing
- convergence rate
- combinatorial optimization
- np complete
- special case