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

Ignacio Araya; Victor Reyes

doi:10.1007/s10898-015-0390-4

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

Ignacio Araya, Victor Reyes

SCHOOL OF COMPUTER ENGINEERING

Research output: Contribution to journal › Article › peer-review

13 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 language	English
Pages (from-to)	837-866
Number of pages	30
Journal	Journal of Global Optimization
Volume	65
Issue number	4
DOIs	https://doi.org/10.1007/s10898-015-0390-4
State	Published - 1 Aug 2016

Keywords

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

Access to Document

10.1007/s10898-015-0390-4

Cite this

@article{11c614788af24a9cb1db73b3801196b3,

title = "Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects",

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 = "Branch and Bound, Constraint propagation, Interval arithmetic, Interval-based solver, Numerical constrained optimization, Numerical constraint satisfaction",

author = "Ignacio Araya and Victor Reyes",

note = "Publisher Copyright: {\textcopyright} 2015, Springer Science+Business Media New York.",

year = "2016",

month = aug,

day = "1",

doi = "10.1007/s10898-015-0390-4",

language = "English",

volume = "65",

pages = "837--866",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - Interval Branch-and-Bound algorithms for optimization and constraint satisfaction

T2 - a survey and prospects

AU - Araya, Ignacio

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

SN - 0925-5001

VL - 65

SP - 837

EP - 866

JO - Journal of Global Optimization

JF - Journal of Global Optimization

IS - 4

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this