Heuristic for the two-dimensional arbitrary stock-size cutting stock problem.
Yaodong CuiYi-Ping CuiLiu YangPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- small sized
- packing problem
- three dimensional
- search algorithm
- dynamic programming
- running times
- computational complexity
- stock market
- column generation
- constraint satisfaction
- linear programming relaxation
- exact algorithms
- integer programming
- stock price
- data sets
- tabu search
- non stationary
- optimal solution
- learning algorithm