A dual algorithm for the constrained shortest path problem.
Gabriel Y. HandlerIsrael ZangPublished in: Networks (1980)
Keyphrases
- dynamic programming
- learning algorithm
- improved algorithm
- preprocessing
- experimental evaluation
- np hard
- detection algorithm
- path planning
- high accuracy
- times faster
- single pass
- k means
- selection algorithm
- computational complexity
- optimal solution
- particle swarm optimization
- computationally efficient
- worst case
- estimation algorithm
- primal dual
- gradient projection
- matching algorithm
- simulated annealing
- probabilistic model
- computational cost
- cost function
- significant improvement
- artificial neural networks
- search algorithm
- image processing