Graphical symbol retrieval using a branch and bound algorithm.
Nibal NayefThomas M. BreuelPublished in: ICIP (2010)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- test problems
- optimal solution
- np hard
- lower bounding
- combinatorial optimization
- search tree
- precedence constraints
- upper bounding
- single machine scheduling problem
- variable ordering
- lagrangian relaxation
- finding an optimal solution
- search algorithm
- randomly generated problems
- symbol recognition
- mixed integer linear programming
- max sat
- branch and bound method
- retrieval model
- particle swarm optimization
- maximum clique
- computational complexity