论文信息 - Cyclic group and knapsack facets

Cyclic group and knapsack facets

Abstract. 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.

Ellis L. Johnson | Julián Aráoz | Lisa Evans | Ralph E. Gomory

[1] Philip Wolfe,et al. Contributions to the theory of games , 1953 .

[2] Ellis L. Johnson,et al. Corner Polyhedra and their connection with cutting planes , 2003, Math. Program..

[3] Egon Balas,et al. Gomory cuts revisited , 1996, Oper. Res. Lett..

[4] Ellis L. Johnson,et al. T-space and cutting planes , 2003, Math. Program..

[5] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra, II , 1972, Math. Program..

[6] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .

[7] H. Raiffa,et al. 3. The Double Description Method , 1953 .

[8] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..

[9] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..

[10] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[11] Peter L. Hammer,et al. Facet of regular 0–1 polytopes , 1975, Math. Program..