This chapter presents the advanced version of our fully interval-based branch-and-bound
optimization algorithm for solving point arrangement problems. Our starting point is again the …

The role of the interval subdivision-selection rule is investigated in branch-and-bound
algorithms for global optimization. The class of rules that allows convergence for the model …

Our original task [8] was to solve parameter estimation problems having very complex nonlinear
objective functions with a relatively small number of parameters. Their evaluation was …

The multistart clustering global optimization method called GLOBAL has been introduced in
the 1980s for bound constrained global optimization problems with black-box type objective …

This paper investigates the influence of the interval subdivision selection rule on the convergence
of interval branch-and-bound algorithms for global optimization. For the class of rules …

This paper presents a new verified optimization method for the problem of finding the
densest packings of nonoverlapping equal circles in a square. In order to provide reliable …

In recent years global optimization has found applications in many interesting areas of
science and technology including molecular biology, chemical equilibrium problems, medical …

… The Hungarian mathematicians Dezso LBzBr and LBszl6 Fejes T6th have already
investigated the problem before 1940 (Staar, 1990; Szab6 and Csendes, 2001). The …

Interval analysis is a powerful tool which allows to design branch-and-bound algorithms
able to solve many global optimization problems. In this paper we present new adaptive …

The mechanical impedance of the lungs (ZL) was measured in open-chest dogs with small-amplitude
pseudorandom volume oscillations between 0.125 and 5 Hz, at mean …