Discrete relaxations of combinatorial programs
This paper investigates a technique of building up discrete relaxations of combinatorial optimization problems. To establish such a relaxation we introduce a transformation technique  aggregation  that allows one to relax an integer program by means of another integer program. We show that knapsack and set packing relaxations give rise to combinatorial cutting planes in a simple and straightforward way. The constructions are algorithmic.
integer programming cutting planes polyhedral combinatorics