Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem.
Vittorio ManiezzoPublished in: INFORMS J. Comput. (1999)
Keyphrases
- quadratic assignment problem
- exact and approximate
- search procedures
- lower bound
- tabu search
- branch and bound
- search procedure
- search strategies
- game tree
- upper bound
- beam search
- tree search
- metaheuristic
- combinatorial optimization
- search algorithm
- lower and upper bounds
- constraint satisfaction problems
- routing problem
- satisfiability problem
- dynamic programming
- objective function
- search methods
- query evaluation
- vehicle routing problem
- string matching
- np hard
- search space
- optimal solution
- branch and bound algorithm
- b tree
- game playing
- neural network
- ant colony optimization
- machine learning