A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem.
Reinaldo MorabitoVitória PurezaPublished in: Ann. Oper. Res. (2010)
Keyphrases
- guillotine cutting
- dynamic programming
- search algorithm
- exhaustive search
- search strategies
- greedy search
- search strategy
- search methods
- tree search algorithm
- search space
- forward search
- search effort
- search efficiency
- packing problem
- three dimensional
- hill climbing
- dynamic programming algorithms
- depth first search
- search engine
- stereo matching
- simulated annealing
- multi dimensional
- state space
- search procedure
- search queries
- coarse to fine
- greedy algorithm
- heuristic search algorithms
- iterative deepening
- heuristic functions
- branch and bound search
- optimal solution
- genetic algorithm