The Principles of Cutting-Plane Theory. Part II. Algebraic Methods, Disjunctive Methods.

摘要

In this paper the author, surveys the algebraic and disjunctive methods, and includes several new results, such as finiteness proofs for new classes of cuttingplane algorithms, a subadditive algorithm for integer programs, and sharpened results on subadditive dual programs, plus other theorems. The author has tried to bring together many of the most quoted results in the theory of integer programming, to provide the most concise proofs for these of which he is aware, and to show the interrelations between these results.