integer linear programming problem

It is proved to be NP-hard.

Other problem sets includes:

1) maximum independent set problem

2) Knapsack problem