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

Ignacio Araya () and Victor Reyes ()
Additional contact information
Ignacio Araya: Pontificia Universidad Católica de Valparaíso
Victor Reyes: Universidad Técnica Federico Santa María

Journal of Global Optimization, 2016, vol. 65, issue 4, No 9, 837-866

Abstract: Abstract 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.

Keywords: Interval arithmetic; Constraint propagation; Numerical constrained optimization; Numerical constraint satisfaction; Interval-based solver; Branch and Bound (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-015-0390-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:65:y:2016:i:4:d:10.1007_s10898-015-0390-4

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-015-0390-4

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().