An algorithm to determine a path with minimal cost/capacity ratio.
Ernesto de Queirós Vieira MartinsPublished in: Discret. Appl. Math. (1984)
Keyphrases
- minimal cost
- dynamic programming
- learning algorithm
- k means
- computational cost
- optimization algorithm
- significant improvement
- cost function
- preprocessing
- computational complexity
- detection algorithm
- matching algorithm
- optimal solution
- probabilistic model
- shortest path
- shortest path problem
- lower bound
- np hard
- neural network
- worst case
- mathematical model
- network flow problem