Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem.
François VanderbeckPublished in: Oper. Res. (2000)
Keyphrases
- computational complexity
- improved algorithm
- space complexity
- computational effort
- detection algorithm
- computational cost
- learning algorithm
- matching algorithm
- running times
- execution times
- times faster
- expectation maximization
- small number
- preprocessing
- significant improvement
- k means
- experimental evaluation
- brute force
- optimal solution
- estimation algorithm
- recognition algorithm
- path planning
- search space
- classification algorithm
- tree structure
- segmentation algorithm
- computationally efficient
- input data
- high accuracy
- ant colony optimization
- optimization algorithm
- lower bound
- data structure
- simulated annealing
- probabilistic model
- image segmentation
- neural network