Conjunctive Cuts for Integer Programs
Please always quote using this URN: urn:nbn:de:0297-zib-3618
- 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.
Author: | Alexander Martin, Robert Weismantel |
---|---|
Document Type: | ZIB-Report |
Tag: | Integer Programming; Polyhedral Combinatorics; Separation Algorithm |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming |
Date of first Publication: | 1998/07/06 |
Series (Serial Number): | ZIB-Report (SC-98-18) |
ZIB-Reportnumber: | SC-98-18 |