Anytime AND/OR Depth-First Search for Combinatorial Optimization.
Lars OttenRina DechterPublished in: SOCS (2011)
Keyphrases
- combinatorial optimization
- depth first search
- branch and bound
- branch and bound algorithm
- breadth first search
- search tree
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- tree search
- traveling salesman problem
- mathematical programming
- combinatorial problems
- routing problem
- optimization problems
- vehicle routing problem
- spanning tree
- orders of magnitude
- dynamic programming
- parallel tree search