A branch and bound strategy for Fast Trajectory Similarity Measuring.
Andre Salvaro FurtadoLaércio Lima PillaVania BogornyPublished in: Data Knowl. Eng. (2018)
Keyphrases
- branch and bound
- branch and bound algorithm
- search algorithm
- lower bound
- search strategies
- upper bound
- search space
- column generation
- optimal solution
- combinatorial optimization
- beam search
- branch and bound method
- depth first search
- randomly generated problems
- branch and bound procedure
- tree search algorithm
- branch and bound search
- tree search
- lagrangian heuristic
- partial solutions
- search strategy
- network design problem
- max sat
- integer programming problems
- genetic algorithm
- neural network
- traveling salesman problem