Result: Global optimization and constraint satisfaction: The branch-and-reduce approach
Title:
Global optimization and constraint satisfaction: The branch-and-reduce approach
Authors:
Source:
Global optimization and constraint satisfaction (Valbonne-Sophia Antipolis, 2-4 October 2002, revised selected papers)Lecture notes in computer science. :1-16
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 46 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Programmation mathématique, Mathematical programming, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Analyse non convexe, Non convex analysis, Análisis no convexo, Méthode séparation et évaluation, Branch and bound method, Método branch and bound, Optimisation sous contrainte, Constrained optimization, Optimización con restricción, Optimum global, Global optimum, Optimo global, Programmation non convexe, Non convex programming, Programación no convexa, Programmation non linéaire, Non linear programming, Programación no lineal, Programmation partiellement en nombres entiers, Mixed integer programming, Programación mixta entera, Ramification, Branching, Ramificación, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Théorie algorithme, Algorithm theory
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Illinois, Department of Chemical and Biomolecular Engineering, Urbana, IL 61801, United States
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Operational research. Management
Operational research. Management
Accession Number:
edscal.15758842
Database:
PASCAL Archive
Further Information
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.