+ 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.
Klaus JansenRoberto Solis-ObaPublished in: IPCO (2010)
Keyphrases
- computational effort
- k means
- memory requirements
- computational complexity
- alphabet size
- small number
- cost function
- significant improvement
- search space
- space complexity
- cluster centers
- minimum distance
- dynamic programming
- recognition algorithm
- constant factor
- detection algorithm
- learning algorithm
- times faster
- matching algorithm
- d objects
- experimental evaluation
- np hard
- preprocessing
- expectation maximization
- optimization algorithm
- simulated annealing
- tree structure
- high accuracy
- worst case
- data structure
- objective function
- similarity measure
- neural network