论文信息 - Inequalities from Two Rows of a Simplex Tableau

Inequalities from Two Rows of a Simplex Tableau

In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice point free bodies and the derivation of inequalities for mixed integer linear programs by considering two rows of a simplex tableau simultaneously.

[1] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[2] Ellis L. Johnson. On the group problem for mixed integer programming , 1974 .

[3] Stanley Rabinowitz,et al. A Census of Convex Lattice Polygons with at most one , 2005 .

[4] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[5] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..

[6] J. Arkinstall,et al. Minimal requirements for Minkowski's theorem in the plane I , 1980, Bulletin of the Australian Mathematical Society.

[7] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .