Anytime AND/OR depth-first search for combinatorial optimization.
Lars OttenRina DechterPublished in: AI Commun. (2012)
Keyphrases
- combinatorial optimization
- depth first search
- branch and bound
- branch and bound algorithm
- breadth first search
- combinatorial optimization problems
- search tree
- traveling salesman problem
- tree search
- simulated annealing
- metaheuristic
- combinatorial problems
- mathematical programming
- optimization problems
- routing problem
- spanning tree
- vehicle routing problem
- search strategies
- neural network
- cost function
- combinatorial search
- search algorithm