Various meta-heuristic optimization approaches have been recently created and applied in
different areas. Many of these approaches are inspired by swarm behaviors in the nature …

We discuss some difficulties in determining valid upper bounds in spatial branch-and-bound
methods for global minimization in the presence of nonconvex constraints. In fact, two …

We present in this article new strategies for selecting nodes in interval Branch and Bound
algorithms for constrained global optimization. For a minimization problem the standard best …

In this paper, we revisit the α α BB method for solving global optimization problems. We
investigate optimality of the scaling vector used in Gerschgorin's inclusion theorem to …

Depuis une vingtaine d'années, la résolution de problèmes d'optimisation globale non
convexes avec contraintes a connu un formidable essor. Les algorithmes de branch and …

In branch and bound algorithms in constrained global optimization, a sharp upper bound on
the global optimum is important for the overall efficiency of the branch and bound process …

In previous work, we, and also Epperly and Pistikopoulos, proposed an analysis of general
nonlinear programs that identified certain variables as convex, not ever needing subdivision …

The classical α BB α BB method is a global optimization method the important step of which
is to determine a convex underestimator of an objective function on an interval domain. Its …

The paper answers an open problem introduced by Bezdek and Fodor (Arch. Math. 74: 75–
80, 2000). The width of any unit-diameter octagon is shown to be less than or equal to 1 4 …

The optimum and at least one optimizing point for convex nonlinear programs can be
approximated well by the solution to a linear program (a fact long used in branch and bound …