暂无分享,去创建一个
[1] Shmuel Onn,et al. Geometry, Complexity, and Combinatorics of Permutation Polytopes , 1993, J. Comb. Theory A.
[2] Michel Deza,et al. The cut cone III: On the role of triangle facets , 1992, Graphs Comb..
[3] A. Maksimenko,et al. An analog of the cook theorem for polytopes , 2012 .
[4] Tomomi Matsui,et al. A study of the quadratic semi-assignment polytope , 2009, Discret. Optim..
[5] Volker Kaibel,et al. A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially , 2013, Discret. Comput. Geom..
[6] Shmuel Onn. Two graph isomorphism polytopes , 2009, Discret. Math..
[7] A. Maksimenko. Traveling salesman polytopes and cut polytopes. Affine reducibility , 2013 .
[8] Michel Deza,et al. Geometry of cuts and metrics , 2009, Algorithms and combinatorics.
[9] A. Maksimenko. k-Neighborly Faces of the Boolean Quadric Polytopes , 2014 .
[10] H. P. Young,et al. On permutations and permutation polytopes , 1978 .
[11] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.
[12] Aleksandr Maksimenko,et al. A special place of Boolean quadratic polytopes among other combinatorial polytopes , 2014, ArXiv.