TY - JOUR
T1 - Interval Branch-and-Bound algorithms for optimization and constraint satisfaction
T2 - a survey and prospects
AU - ARAYA ZAMORANO, IGNACIO DANIEL
AU - Reyes, Victor
PY - 2016/8/1
Y1 - 2016/8/1
N2 - 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.
AB - 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.
KW - Branch and Bound
KW - Constraint propagation
KW - Interval arithmetic
KW - Interval-based solver
KW - Numerical constrained optimization
KW - Numerical constraint satisfaction
UR - http://www.scopus.com/inward/record.url?scp=84951910304&partnerID=8YFLogxK
U2 - 10.1007/s10898-015-0390-4
DO - 10.1007/s10898-015-0390-4
M3 - Article
AN - SCOPUS:84951910304
VL - 65
SP - 837
EP - 866
JO - Journal of Global Optimization
JF - Journal of Global Optimization
SN - 0925-5001
IS - 4
ER -