A polynomial-time algorithm for the change-making problem.
David PearsonPublished in: Oper. Res. Lett. (2005)
Keyphrases
- computational complexity
- dynamic programming
- learning algorithm
- detection algorithm
- optimization algorithm
- theoretical analysis
- experimental evaluation
- computational cost
- segmentation algorithm
- significant improvement
- improved algorithm
- optimal solution
- objective function
- matching algorithm
- cost function
- preprocessing
- search space
- high accuracy
- genetic algorithm
- clustering algorithm
- mobile robot
- times faster
- recognition algorithm
- space complexity
- approximation ratio
- polynomial time approximation