Learn More

The subset sum problem is defined as: given a set of n + 1 positive integers, al, a 2 ..... a, and b, find a subset of the ai's such that their sum is the closest to b without exceeding the value b. We propose a variation of the well-known polynomial approximation scheme of Martello and Toth for this problem. From a practical point of view the suggested… (More)

- ‹
- 1
- ›