During branch and bound search in deterministic global optimization, adaptive subdivision is used to produce subregions x, which are then eliminated, shown to contain an optimal point, reduced in size, or further subdivided. The various techniques used to reduce or eliminate a subregion x determine the efficiency and practicality of the algorithm. Ryoo and Sahinidis have proposed a “probing” te...