A class of problems that can be solved using interval algorithms
The paper discusses several theoretical and implementational problems of interval branch-and-bound methods. A trial to define a class of problems that can be solved with such methods is done. Features and variants of the method are presented. Useful data structures and shared-memory parallelization issues are considered.
branch-and-bound data structures interval methods predicate logic multithreaded programming