A Branch-and-Bound Approach to Correspondence and Grouping Problems.
Jean-Charles BazinHongdong LiInso KweonCédric DemonceauxPascal VasseurKatsushi IkeuchiPublished in: IEEE Trans. Pattern Anal. Mach. Intell. (2013)
Keyphrases
- branch and bound
- branch and bound procedure
- lower bound
- branch and bound method
- randomly generated problems
- combinatorial optimization
- search space
- branch and bound algorithm
- search algorithm
- upper bound
- column generation
- partial solutions
- network design problem
- integer programming problems
- optimization problems
- traveling salesman problem
- state space
- beam search
- linear programming relaxation
- optimal solution
- genetic algorithm
- lagrangian heuristic
- tree search algorithm
- branch and bound search
- tree search
- approximation algorithms
- np hard