Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract).
Lars OttenRina DechterPublished in: CP (2014)
Keyphrases
- extended abstract
- combinatorial optimization
- depth first search
- branch and bound
- breadth first search
- branch and bound algorithm
- combinatorial optimization problems
- search tree
- traveling salesman problem
- metaheuristic
- tree search
- simulated annealing
- optimization problems
- mathematical programming
- routing problem
- vehicle routing problem
- spanning tree
- parallel tree search
- neural network
- combinatorial search
- greedy algorithm
- lower bound