SC 98-18 Alexander Martin, Robert Weismantel: Conjunctive Cuts for Integer Programs
Abstract: This paper deals with a family of conjunctive inequalities.
Such
inequalities are needed to describe the polyhedron associated with all
the integer points that satisfy several knapsack constraints
simultaneously. Here we demonstrate the strength and potential of
conjunctive inequalities in connection with lifting from a
computational point of view.
Keywords: Polyhedral Combinatorics,
Integer Programming,
Separation Algorithm
MSC: 90C10