On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
暂无分享,去创建一个
[1] Claus-Peter Schnorr,et al. Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.
[2] Gérard Cornuéjols,et al. On the rank of mixed 0,1 polyhedra , 2002, Math. Program..
[3] Laurence A. Wolsey,et al. Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.
[4] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[5] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[6] Ellis L. Johnson. On the group problem for mixed integer programming , 1974 .
[7] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .
[8] Herbert E. Scarf. An observation on the structure of production sets with indivisibilities , 1977 .
[9] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[10] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[11] Robert R. Meyer,et al. On the existence of optimal solutions to integer and mixed-integer programming problems , 1974, Math. Program..
[12] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[13] Gérard Cornuéjols,et al. Minimal Valid Inequalities for Integer Constraints , 2009, Math. Oper. Res..
[14] David E. Bell. A Theorem Concerning the Integer Lattice , 1977 .
[15] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[16] Laurence A. Wolsey,et al. Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles , 2008, IPCO.
[17] L. Wolsey,et al. Cutting Planes form Two Rows of a Simplex Tableau , 2007 .