A Formal Basis for the Heuristic Determination of Minimum Cost Paths.
Peter E. HartNils J. NilssonBertram RaphaelPublished in: IEEE Trans. Syst. Sci. Cybern. (1968)
Keyphrases
- minimum cost
- minimum cost path
- np hard
- spanning tree
- approximation algorithms
- network flow
- network flow problem
- optimal solution
- capacity constraints
- tabu search
- shortest path
- edit operations
- minimum cost flow
- optimization problems
- simulated annealing
- dynamic programming
- path planning
- search algorithm
- undirected graph
- weight function