+ 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths.
Klaus JansenRoberto Solis-ObaPublished in: Math. Oper. Res. (2011)
Keyphrases
- computational complexity
- learning algorithm
- computational effort
- experimental evaluation
- times faster
- preprocessing
- np hard
- memory requirements
- simulated annealing
- single scan
- integer programming
- segmentation algorithm
- high accuracy
- worst case
- dynamic programming
- cost function
- significant improvement
- optimization algorithm
- computational cost
- convex hull
- space complexity
- undirected graph
- neural network