Review of combinatorial problems induced by spatial forest harvesting planning.
Andrés WeintraubAlan T. MurrayPublished in: Discret. Appl. Math. (2006)
Keyphrases
- combinatorial problems
- constraint programming
- metaheuristic
- graph coloring
- constraint satisfaction problems
- combinatorial optimization
- constraint satisfaction
- traveling salesman problem
- phase transition
- solving hard
- branch and bound algorithm
- combinatorial search
- graph colouring
- planning problems
- global constraints
- spatial information
- sat encodings
- heuristic search
- planning domains
- specific problems
- symmetry breaking
- boolean satisfiability
- search strategies
- domain independent
- simulated annealing
- upper bound
- lower bound
- hard combinatorial optimization problems
- genetic algorithm