The disadvantage of the subset-sum algorithm is that it solves only a decision—a yes-or-no problem—and doesn't allow restoring the partition itself. To overcome this disadvantage, you can use an array ...

We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations ...

In the case of polynomial regression, the variable selection process can be further complicated by the need to obtain subsets that are hierarchically well formulated. We present a branch-and-bound ...