暂无分享,去创建一个
[1] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[2] Jean B. Lasserre,et al. Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..
[3] Friedrich Eisenbrand,et al. On the Chvátal Rank of Polytopes in the 0/1 Cube , 1999, Discret. Appl. Math..
[4] Daniel Dadush,et al. The Chvátal-Gomory Closure of a Strictly Convex Body , 2011, Math. Oper. Res..
[5] Marco Di Summa,et al. Reverse Chvátal-Gomory Rank , 2013, SIAM J. Discret. Math..
[6] Jean B. Lasserre,et al. An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.
[7] Laura Sanità,et al. 0/1 Polytopes with Quadratic Chvátal Rank , 2013, IPCO.
[8] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[9] Friedrich Eisenbrand,et al. NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..
[10] Daniel Dadush,et al. On the Chvátal–Gomory closure of a compact convex set , 2010, Math. Program..
[11] Monique Laurent,et al. A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..
[12] Madhur Tulsiani,et al. Convex Relaxations and Integrality Gaps , 2012 .
[13] Andreas S. Schulz,et al. The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope , 2012, OR.
[14] E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .
[15] Friedrich Eisenbrand,et al. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.
[16] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[17] Michael Joswig,et al. Algorithms for highly symmetric linear and integer programs , 2010, Mathematical Programming.
[18] Sebastian Pokutta,et al. Lower bounds for the Chvátal-Gomory rank in the 0/1 cube , 2011, Oper. Res. Lett..
[19] Daniel Dadush,et al. On the Chvátal–Gomory closure of a compact convex set , 2011, Mathematical Programming.
[20] Sebastian Pokutta,et al. Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank , 2011, Oper. Res. Lett..
[21] Mohit Singh,et al. Improving Integrality Gaps via Chvátal-Gomory Rounding , 2010, APPROX-RANDOM.
[22] William J. Cook,et al. On cutting-plane proofs in combinatorial optimization , 1989 .
[23] G. Ziegler. Lectures on 0/1-Polytopes , 1999, math/9909177.
[24] C. Burdet,et al. On cutting planes , 1973 .