Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime

Divesh Aggarwal, Antoine Joux, Miklos Santha +1

The Unbounded Subset Sum (USS) problem is an NP-hard computational problem where the goal is to decide whether there exist non-negative integers $x_1,\dots ,x_n$ such that $x_1 a…