Reverse Chvátal-Gomory Rank
暂无分享,去创建一个
Marco Di Summa | Michele Conforti | Roland Grappe | Alberto Del Pia | Yuri Faenza | Michele Conforti | Alberto Del Pia | Marco Di Summa | Yuri Faenza | Roland Grappe
[1] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[2] Friedrich Eisenbrand,et al. On the Chvátal Rank of Polytopes in the 0/1 Cube , 1999, Discret. Appl. Math..
[3] Claus-Peter Schnorr,et al. Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.
[4] Marco Di Summa,et al. On the Convergence of the Affine Hull of the Chvátal-Gomory Closures , 2012, SIAM J. Discret. Math..
[5] William J. Cook,et al. On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..
[6] Friedrich Eisenbrand,et al. Parametric Integer Programming in Fixed Dimension , 2008, Math. Oper. Res..
[7] Sebastian Pokutta,et al. Lower bounds for the Chvátal-Gomory rank in the 0/1 cube , 2011, Oper. Res. Lett..
[8] Alexander Barvinok,et al. A course in convexity , 2002, Graduate studies in mathematics.
[9] Friedrich Eisenbrand,et al. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* , 2003, Comb..
[10] Günter M. Ziegler,et al. Projecting Lattice Polytopes Without Interior Lattice Points , 2011, Math. Oper. Res..
[11] Gérard Cornuéjols,et al. Maximal Lattice-Free Convex Sets in Linear Subspaces , 2010, Math. Oper. Res..
[12] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[13] Laura Sanità,et al. 0/1 Polytopes with Quadratic Chvátal Rank , 2013, IPCO.
[14] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[15] William J. Cook,et al. On cutting-plane proofs in combinatorial optimization , 1989 .
[16] Alexander Schrijver,et al. On Cutting Planes , 1980 .
[17] Jeffrey C. Lagarias,et al. Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice , 1991, Canadian Journal of Mathematics.