Mixed-integer sets from two rows of two adjacent simplex bases
暂无分享,去创建一个
[1] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra, II , 1972, Math. Program..
[2] Claus-Peter Schnorr,et al. Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.
[3] Laurence A. Wolsey,et al. Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.
[4] J. Arkinstall,et al. Minimal requirements for Minkowski's theorem in the plane I , 1980, Bulletin of the Australian Mathematical Society.
[5] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[6] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[7] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[8] Gérard Cornuéjols,et al. On the facets of mixed integer programs with two integer variables and two constraints , 2008, Math. Program..
[9] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[10] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[11] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[12] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.