A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem

Majid Salimi, Hamid Mala

The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots ,p_n\}$ output a set of non-negative integers $\{y_1,\dots ,y_n\}$…