Pre-print de la comunicacion presentada al ICCSA2015Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re nement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. A range of possibilities arises in higher dimensions where the number of longest edges in a simplex is greater than one. The behaviour of the search and the resulting binary search tree depend on the se- lected longest edge. In this work, we investigate different rules to select a longest edge and study the resulting efficiency of the branch and bound algorithm.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
International audienceWe present in this article a new strategy for selecting the current node in an...
AbstractWe consider the problem of optimizing a Lipshitzian function. The branch and bound technique...
<p>A natural way to define branching in branch and bound (B&B) for blending problems is bisectio...
Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re...
In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refi...
In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refi...
Simplicial subsets are popular in branch-and-bound methods for Global Optimization. Longest Edge Bis...
In several areas like global optimization using branch-and-bound methods for mixture design, the uni...
In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is...
We examine the longest-edge bisection algorithm which chooses for bisection the longest edge in a gi...
Branch and Bound (B&B) algorithms in Global Optimization are used to perform an exhaustive search ov...
In this paper, we develop a kind of branch-and-bound algorithm for solving concaveminimization probl...
International audienceWe present in this article new strategies for selecting nodes in interval Bran...
Refinement of the unit simplex by iterative longest edge bisection (LEB) up to sub-simplices have a ...
Branch and bound algorithms are methods for global optimization in nonconvex prob-lems [LW66, Moo91]...
International audienceWe present in this article a new strategy for selecting the current node in an...
AbstractWe consider the problem of optimizing a Lipshitzian function. The branch and bound technique...
<p>A natural way to define branching in branch and bound (B&B) for blending problems is bisectio...
Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re...
In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refi...
In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refi...
Simplicial subsets are popular in branch-and-bound methods for Global Optimization. Longest Edge Bis...
In several areas like global optimization using branch-and-bound methods for mixture design, the uni...
In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is...
We examine the longest-edge bisection algorithm which chooses for bisection the longest edge in a gi...
Branch and Bound (B&B) algorithms in Global Optimization are used to perform an exhaustive search ov...
In this paper, we develop a kind of branch-and-bound algorithm for solving concaveminimization probl...
International audienceWe present in this article new strategies for selecting nodes in interval Bran...
Refinement of the unit simplex by iterative longest edge bisection (LEB) up to sub-simplices have a ...
Branch and bound algorithms are methods for global optimization in nonconvex prob-lems [LW66, Moo91]...
International audienceWe present in this article a new strategy for selecting the current node in an...
AbstractWe consider the problem of optimizing a Lipshitzian function. The branch and bound technique...
<p>A natural way to define branching in branch and bound (B&B) for blending problems is bisectio...