International audienceWe present in this article a new strategy for selecting the current node in an interval Branch and Bound algorithm for constrained global optimization. The standard best-first strategy selects the node with the lowest lower bound of the objective estimate. We propose in this article new node selection policies where an upper bound of each node/box is also taken into account. The good accuracy of this upper bound achieved by several operators leads to a good performance of the criterion. These new strategies obtain better experimental results than classical best-first search on difficult instances
International audienceIn deterministic constrained global optimization, upper bounding the objective...
The most widely used guaranteed methods for global optimization are probably the interval-based bran...
International audienceResearchers from interval analysis and constraint (logic) programming communit...
International audienceWe present in this article new strategies for selecting nodes in interval Bran...
International audienceWe present in this article a new strategy for selecting the current node in an...
International audienceNous présentons dans cet article de nouvelles stra-tégies de choix de noeud da...
Depuis quelques années, la méthode de séparation et évaluation par intervalles (Interval Branch and ...
We introduce a very simple but e±cient idea for branch & bound (B&B) algorithms in global op...
Global nonlinear optimization problems can be solved by interval subdivision methods with guaranteed...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
The talk gives an overview on the numerical test results of solving inequality constrained global op...
AbstractThis paper deals with two different optimization techniques to solve the bound-constrained n...
International audienceIn deterministic constrained global optimization, upper bounding the objective...
The most widely used guaranteed methods for global optimization are probably the interval-based bran...
International audienceResearchers from interval analysis and constraint (logic) programming communit...
International audienceWe present in this article new strategies for selecting nodes in interval Bran...
International audienceWe present in this article a new strategy for selecting the current node in an...
International audienceNous présentons dans cet article de nouvelles stra-tégies de choix de noeud da...
Depuis quelques années, la méthode de séparation et évaluation par intervalles (Interval Branch and ...
We introduce a very simple but e±cient idea for branch & bound (B&B) algorithms in global op...
Global nonlinear optimization problems can be solved by interval subdivision methods with guaranteed...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
The talk gives an overview on the numerical test results of solving inequality constrained global op...
AbstractThis paper deals with two different optimization techniques to solve the bound-constrained n...
International audienceIn deterministic constrained global optimization, upper bounding the objective...
The most widely used guaranteed methods for global optimization are probably the interval-based bran...
International audienceResearchers from interval analysis and constraint (logic) programming communit...