On Cutting Planes and Matrices
暂无分享,去创建一个
Continuing the work of Chvatal and Gomory, Schrljver proved that any rational polyhedron {xlAx<;b} has finite Chv&tal rank. This was extended by Cook, Gerards, Schrljver and Tardos, who proved that in fact this Chv&tal rank can be bounded from above by a number only depending on A, so Independent of b. The aim of this note is to show that the latter result can be proved quite easily from the result of Chv&tal and Schrljver.
[1] William J. Cook,et al. Sensitivity theorems in integer linear programming , 1986, Math. Program..
[2] Charles E. Blair,et al. The value function of an integer program , 1982, Math. Program..
[3] C. Burdet,et al. On cutting planes , 1973 .
[4] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[5] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .