Integer Optimization - Cover Inequalities for the 0,1 Knapsack Problem

Course: Integer Optimization - ISyE/Math/CS 728 Topic: Cover Inequalities for the 0,1 Knapsack Problem Professor: Alberto Del Pia, University of Wisconsin-Madison Based on Section 7.1 of the book "Integer Programming" by M. Conforti, G. Cornuéjols, and G. Zambelli