A well-known pseudo-polynomial algorithm (Reference 1) defines a table: T [ij], 1≤i≤m and 1≤j≤n, to be T [ij]5= true if and only if a subset of W [1],…W [i] sums to exactly j. The algorithm uses O (mn ...

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