Optimal circle fitting via branch and bound.
Emanuel ZelnikerBenjamin C. AppletonI. Vaughan L. ClarksonPublished in: ICASSP (4) (2005)
Keyphrases
- branch and bound
- optimal solution
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- upper bound
- search space
- branch and bound procedure
- branch and bound method
- combinatorial optimization
- search strategies
- randomly generated problems
- tree search
- worst case
- integer programming problems
- max sat
- beam search
- network design problem
- np hard
- implicit enumeration
- objective function
- linear program
- linear programming
- cost function
- tree search algorithm