Abstract: Given a multiset of n positive integers and a target sum S, the subset sum problem is to find a subset such that the sum of its elements is as close as possible to S without exceeding S. We ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback