A generic auction algorithm for the minimum cost network flow problem.
Dimitri P. BertsekasDavid A. CastañónPublished in: Comput. Optim. Appl. (1993)
Keyphrases
- minimum cost
- network flow problem
- np hard
- network flow
- network simplex algorithm
- minimal cost
- spanning tree
- dynamic programming
- minimum cost flow
- approximation algorithms
- network design problem
- optimal solution
- search space
- worst case
- simulated annealing
- computational complexity
- scheduling problem
- integer programming
- energy minimization
- path planning
- np complete
- linear programming
- minimum cost path