SC 99-44 Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey: Cutting Planes in Integer and Mixed Integer Programming (in
preparation)
Abstract: This survey presents cutting planes that are useful or
potentially useful in solving mixed integer programs.
Valid inequalities for i) general integer programs,
ii) problems with local structure such as knapsack
constraints, and iii) problems with 0-1 coefficient
matrices, such as set packing, are examined in turn.
Finally the use of valid inequalities for classes of
problems with structure, such as network design, is
explored.
Keywords: Mixed Integer Programming,
Cutting Planes
MSC: 90C10, 90C11