A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting.
Gleb BelovGuntram ScheithauerPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- experimental evaluation
- learning algorithm
- objective function
- improved algorithm
- dynamic programming
- computational cost
- single pass
- optimal solution
- classification algorithm
- detection algorithm
- k means
- significant improvement
- linear programming
- multi dimensional
- optimization algorithm
- computationally efficient
- simulated annealing
- high accuracy
- np hard
- preprocessing
- computational complexity
- three dimensional
- maximum likelihood
- cost function
- search space
- times faster
- memory requirements
- recognition algorithm
- estimation algorithm
- packing problem