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 ...

Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling. The fundamental task is to ...

This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit ...