Interval Branch and Bound algorithms are used to solve rigorously continuous constraint satisfaction and constrained global optimization problems. In this paper, we explain the basic principles behind interval Branch and Bound algorithms. We detail the main components and describe issues that should be considered to improve the efficiency of the algorithms.
- Branch and Bound
- Constraint propagation
- Interval arithmetic
- Interval-based solver
- Numerical constrained optimization
- Numerical constraint satisfaction