Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects

被引：0
作者：
Ignacio Araya
Victor Reyes
机构：
[1] Pontificia Universidad Católica de Valparaíso,Escuela Informática
[2] Universidad Técnica Federico Santa María,Depto. Informática
来源：
Journal of Global Optimization | 2016年 / 65卷
关键词：
Interval arithmetic; Constraint propagation; Numerical constrained optimization; Numerical constraint satisfaction; Interval-based solver; Branch and Bound;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：837 / 866
页数：29
相关论文
共 129 条
[1]  
Araya I(2012)An interval extension based on occurrence grouping Computing 94 173-188
[2]  
Neveu B(2009)Computation of an extractive distillation column with affine arithmetic AIChE J. 55 1695-1704
[3]  
Trombettoni G(2009)Branching and bounds tightening techniques for non-convex MINLP Optim. Methods Softw. 24 597-634
[4]  
Baharev A(1979)New methods to color the vertices of a graph Commun. ACM 22 251-256
[5]  
Achterberg T(2004)Improving interval analysis bounds by translations J. Glob. Optim. 29 157-172
[6]  
Rév E(2001)Experiments with a new selection criterion in a fast interval optimization algorithm J. Glob. Optim. 19 247-264
[7]  
Belotti P(1847)Méthode générale pour la résolution des systemes déquations simultanées C. R. Sci. Paris 25 536-538
[8]  
Lee J(2002)Horner’s rule for interval evaluation revisited Computing 69 51-81
[9]  
Liberti L(2004)Greedy algorithms for optimizing multivariate Horner schemes ACM SIGSAM Bull. 38 8-15
[10]  
Margot F(2009)Contractor programming Artif. Intell. 173 1079-1100
12345678910