Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions.
Leocadio G. CasadoInmaculada GarcíaYaroslav D. SergeyevPublished in: Reliab. Comput. (2000)
Keyphrases
- branch and bound algorithm
- zero crossing
- lower bound
- branch and bound
- maximum clique
- upper bound
- np hard
- lower bounding
- optimal solution
- combinatorial optimization
- upper bounding
- precedence constraints
- single machine scheduling problem
- randomly generated problems
- edge detection
- mixed integer linear programming
- scale space
- finding an optimal solution
- band limited
- max sat
- directional derivatives
- marr hildreth
- edge detector
- genetic algorithm
- wavelet transform
- search space
- search algorithm
- cost function
- feature vectors
- similarity measure