The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number ...

Valid inequalities, Gomory’s fractional cut, mixed integer cuts, strong valid inequalities, simple facets for 0-1 knapsack polytope and the traveling salesman polytope, branch and cut algorithms ...