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

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

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.

Original languageEnglish
Pages (from-to)837-866
Number of pages30
JournalJournal of Global Optimization
Volume65
Issue number4
DOIs
StatePublished - 1 Aug 2016

Keywords

  • Branch and Bound
  • Constraint propagation
  • Interval arithmetic
  • Interval-based solver
  • Numerical constrained optimization
  • Numerical constraint satisfaction

Fingerprint Dive into the research topics of 'Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects'. Together they form a unique fingerprint.

Cite this