论文信息 - On Cutting Planes

On Cutting Planes

We give a geometrical description of Chvatal's version of Gomory's cutting plane method. Restricting ourselves to rational spaces, we prove that the derived geometrical objects are polyhedra again, and that the method also works for unbounded polyhedra.

Alexander Schrijver | A. Schrijver

[1] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .

[2] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[3] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[4] I. Rosenberg. On chvátal's cutting planes in integer linear programming , 1975 .

[5] W. Pulleyblank,et al. Total Dual Integrality and Integer Polyhedra , 1979 .

[6] Alan J. Hoffman,et al. A generalization of max flow—min cut , 1974, Math. Program..

[7] Th. Motzkin. Beiträge zur Theorie der linearen Ungleichungen , 1936 .