Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing.
Thiago Alves de QueirozFlávio Keidi MiyazawaYoshiko WakabayashiEduardo C. XavierPublished in: Comput. Oper. Res. (2012)
Keyphrases
- optimization problems
- problems in computer vision
- benchmark problems
- related problems
- practical problems
- cutting stock
- difficult problems
- computational cost
- computationally efficient
- combinatorial optimization
- approximate solutions
- packing problem
- test problems
- guillotine cutting
- learning algorithm
- np complete
- data structure
- decision making
- knapsack problem
- computational geometry