TY - JOUR
T1 - Global optimization and constraint satisfaction
T2 - The branch-and-reduce approach
AU - Sahinidis, Nikolaos V.
PY - 2003
Y1 - 2003
N2 - In the early 1990s, we proposed the integration of constraint programming and optimization techniques within the branch-and-bound framework for the global optimization of nonconvex nonlinear and mixed-integer nonlinear programs. This approach, referred to as branch-and-reduce, was subsequently supplemented with a variety of branching and bounding schemes. In this paper, we review the theory and algorithms behind branch-and-reduce, its implementation in the BARON software, and some recent successful applications.
AB - In the early 1990s, we proposed the integration of constraint programming and optimization techniques within the branch-and-bound framework for the global optimization of nonconvex nonlinear and mixed-integer nonlinear programs. This approach, referred to as branch-and-reduce, was subsequently supplemented with a variety of branching and bounding schemes. In this paper, we review the theory and algorithms behind branch-and-reduce, its implementation in the BARON software, and some recent successful applications.
UR - http://www.scopus.com/inward/record.url?scp=0242712751&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0242712751&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-39901-8_1
DO - 10.1007/978-3-540-39901-8_1
M3 - Article
AN - SCOPUS:0242712751
SN - 0302-9743
VL - 2861
SP - 1
EP - 16
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
ER -