The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed. These include integer linear programming (Land-Doig ...

The branch and bound method is a technique that divides the search domain into sub-domains of lower dimensions, enabling the generation of all non-dominated points in multi-objective optimization ...

An efficient branch-and-bound algorithm for computing the best-subset regression models is proposed. The algorithm avoids the computation of the whole regression tree that generates all possible ...

Most Lipschitzian Global Optimization algorithms perform an exhaustive search using a branch-and-bound (B&B) scheme. The question is how to run multi-dimensional Lipschitz Global Optimization in ...

This paper proposes an iterative branch-and-bound (IB&B) approach for complex product assembly station scheduling problems (CPASSP) to minimize the total weighted tardiness (TWT). First, an iterative ...