We develop and analyze a bisection type global optimization algorithm for real Lipschitz functions. The suggested method combines the branch and bound method with an always convergent solver of nonlinear equations. The computer implementation and performance are investigated in detail.

Many document analysis and OCR systems depend on precise identification of page rotation, as well as the reliable identification of text lines. This paper presents a new algorithm to address both problems. It uses a branch-and-bound approach to globally optimal line finding and simultaneously models the baseline and the descender line under a Gaussian error/robust least square model. Results of...

This paper presents an exact algorithm for the team formation problem, in which aim is, given a project and its required skills, to construct capable that can communicate collaborate effectively. combinatorial optimization problem is modeled as quadratic set covering problem. The study provides novel branch-and-bound where reformulation of relaxed so it decomposes into series linear problems, c...

There exist several control approaches for traffic signal control such as fixed-time, vehicle-actuated, or look-ahead traffic-adaptive control. We argue that in order to flexibly deal with varying demand levels movement-based control (which is already common in vehicleactuated intersection control) is required instead of stage-based control (which is still employed in the state-of-the-art in lo...

Over the past few years, attempts to scale up infinite-horizon DECPOMDPs with discounted rewards are mainly due to approximate algorithms, but without the theoretical guarantees of their exact counterparts. In contrast, ε-optimal methods have only theoretical significance but are not efficient in practice. In this paper, we introduce an algorithmic framework (β-PI) that exploits the scalability...

We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equallysized cells while minimizing the number of edges between them. Our algorithm is based on the branch-and-bound framework and, unlike most previous approaches, it is fully combinatorial. We present stronger lower bounds, improved branching rules, and a new decomposition t...

We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore-Lawler Bound and develop new bounds by means of optimal reduction schemes. Computational results are reported indicating that the new lower bounds have advantages over previous bounds and can be used in a branch-and-bound type algorithm for...