References
- M.M. Deza, M. Laurent. Geometry of cuts and metrics, Springer, 1997.
- M. Deza, M. Laurent, and S. Poljak. The cut cone III: on the role of triangle facets, Graphs and Combinatorics, 8 (1992), 125–142; updated 9 (1993), 135–152. doi: https://doi.org/10.1007/BF02350631
- S. Fiorini, S. Massar, S. Pokutta, H.R. Tiwary, R. de Wolf. Exponential Lower Bounds for Polytopes in Combinatorial Optimization, J. ACM, 62 (2015), 17:1–17:23. doi: https://doi.org/10.1145/2716307
- V. Kaibel. Polyhedral combinatorics of the quadratic assignment problem, Ph.D. Thesis, Universität zu Köln, 1997.
- V. Kaibel, S. Weltge. A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially, Discrete and Computational Geometry, 53 (2015), 397–401. doi: https://doi.org/10.1007/s00454-014-9655-9
- A.N. Maksimenko. An analog of the Cook theorem for polytopes, Russian Mathematics, 56 (2012), 28–34. doi: https://doi.org/10.3103/S1066369X1208004X
- A.N. Maksimenko. Traveling salesman polytopes and cut polytopes. Affine reducibility, Discrete Mathematics and Applications, 23 (2013), 251–259. doi: https://doi.org/10.1515/dma-2013-018
- A. Maksimenko. k-Neighborly faces of the Boolean quadric polytopes, Journal of Mathematical Sciences, 203 (2014), 816–822. doi: https://doi.org/10.1007/s10958-014-2171-x
- A. Maksimenko. The common face of some 0/1-polytopes with NP-complete nonadjacency relation. Journal of Mathematical Sciences, 203(6): 823–832, 2014. doi: https://doi.org/10.1007/s10958-014-2172-9
- A. Maksimenko. Boolean quadric polytopes are faces of linear ordering polytopes. Siberian Electronic Mathematical Reports, 14: 640–646, 2017.
- S. Onn. Geometry, complexity, and combinatorics of permutation polytopes, Journal of Combinatorial Theory, Series A, 64(1) (1993), 31– 49. doi: https://doi.org/10.1016/0097-3165(93)90086-N
- S. Onn. Two graph isomorphism polytopes, Discrete Mathematics, 309(9) (2009), 2934–2936. doi: https://doi.org/10.1016/j.disc.2008.07.001
- M. P. Rijal. Scheduling, design and assignment problems with quadratic costs, Ph.D. Thesis, New York University, 1995.
- H. Saito, T. Fujie, T. Matsui, Sh. Matuura. A study of the quadratic semi-assignment polytope, Discrete Optimization, 6(1) (2009), 37–50. doi: https://doi.org/10.1016/j.disopt.2008.08.003
- H.P. Young. On permutations and permutation polytopes, Polyhedral combinatorics, (1978), 128–140. doi: https://doi.org/10.1007/BFb0121198