Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy.
Zeina Abu-AishehRomain RaveauxJean-Yves RamelPublished in: GbRPR (2017)
Keyphrases
- branch and bound
- search space
- search algorithm
- search strategies
- search strategy
- depth first search
- nearest neighbor
- tree search
- tree decomposition
- branch and bound algorithm
- branch and bound search
- lower bound
- tree search algorithm
- optimal solution
- column generation
- beam search
- branch and bound procedure
- heuristic search
- network design problem
- nearest neighbor search
- branch and bound method
- randomly generated problems
- combinatorial optimization
- upper bound
- knn
- high dimensional spaces
- search methods
- search tree
- k nearest neighbor
- iterative deepening
- mini bucket
- max sat
- partial solutions
- search problems
- game tree search
- metaheuristic
- integer programming problems
- state space
- neural network
- exhaustive search
- graph theory
- index structure