Monique Laurent, Svatopluk Poljak, “On a positive semidefinite relaxation of the cut polytope”, Linear Algebra and its Applications, 223-224, 1995, 439
Endre Boros, Peter L. Hammer, “Pseudo-Boolean optimization”, Discrete Applied Mathematics, 123, no. 1-3, 2002, 155
Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey, “Stochastic graph partitioning: quadratic versus SOCP formulations”, Optim Lett, 10, no. 7, 2016, 1505
Monique Laurent, “The real positive semidefinite completion problem for series-parallel graphs”, Linear Algebra and its Applications, 252, no. 1-3, 1997, 347
Adam N. Letchford, Michael M. Sørensen, “Binary positive semidefinite matrices and associated integer polytopes”, Math. Program., 131, no. 1-2, 2012, 253
Michael M. Sørensen, “A Note on Clique-Web Facets for Multicut Polytopes”, Mathematics of OR, 27, no. 4, 2002, 740
Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange, “A polyhedral study of lifted multicuts”, Discrete Optimization, 47, 2023, 100757
Paradigms of Combinatorial Optimization, 2014, 707
Michel Deza, Viatcheslav Grishukhin, “Lattice Points of Cut Cones”, Combinator. Probab. Comp., 3, no. 2, 1994, 191
Chun-Wa Ko, Jon Lee, Einar Steingrímsson, “The volume of relaxed Boolean-quadric and cut polytopes”, Discrete Mathematics, 163, no. 1-3, 1997, 293