A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Cyclic group and knapsack facets
2003
Mathematical programming
Any integer program may be relaxed to a group problem. We define the master cyclic group problem and several master knapsack problems, show the relationship between the problems, and give several classes of facet-defining inequalities for each problem, as well as a set of mappings that take facets from one type of master polyhedra to another. For case 2, we partition indices 3, ..., n into six sets: We now construct a set of relations for i in each set that is almost lower-triangular, and give
doi:10.1007/s10107-003-0390-x
fatcat:jxwdb56vqvfzxetu3a2b72kjhe