Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths".
Peter E. HartNils J. NilssonBertram RaphaelPublished in: SIGART Newsl. (1972)
Keyphrases
- minimum cost
- minimum cost path
- np hard
- approximation algorithms
- network flow problem
- spanning tree
- network flow
- capacity constraints
- network simplex algorithm
- search algorithm
- optimal solution
- path planning
- minimum cost flow
- lagrangian relaxation
- shortest path
- simulated annealing
- integer programming
- branch and bound algorithm
- combinatorial optimization
- tabu search
- edit operations