Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems.
Francis J. VaskoChristopher L. BartkowskiPublished in: Int. Trans. Oper. Res. (2009)
Keyphrases
- difficult problems
- dynamic programming
- learning algorithm
- times faster
- high accuracy
- detection algorithm
- computational complexity
- preprocessing
- search space
- recognition algorithm
- computational cost
- experimental study
- simulated annealing
- improved algorithm
- single pass
- objective function
- matching algorithm
- segmentation method
- clustering method
- optimization algorithm
- theoretical analysis
- computationally efficient
- worst case
- knn
- experimental evaluation
- significant improvement
- k means
- optimal solution
- segmentation algorithm
- particle swarm optimization
- classification algorithm
- cost function
- estimation algorithm
- search algorithm