John E. Mitchell, 1997, Operations Research Proceedings 1997, 1998, 114
Paradigms of Combinatorial Optimization, 2014, 707
Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel, “An SDP approach to multi-level crossing minimization”, ACM J. Exp. Algorithmics, 17, 2012
John E. Mitchell, “Computational Experience with an Interior Point Cutting Plane Algorithm”, SIAM J. Optim., 10, no. 4, 2000, 1212
Kyungchul Park, Kyungsik Lee, Sungsoo Park, “An extended formulation approach to the edge-weighted maximal clique problem”, European Journal of Operational Research, 95, no. 3, 1996, 671
Caterina De Simone, Michel Deza, Monique Laurent, “Collapsing and lifting for the cut cone”, Discrete Mathematics, 127, no. 1-3, 1994, 105
Marcel Hunting, Ulrich Faigle, Walter Kern, “A Lagrangian relaxation approach to the edge-weighted clique problem”, European Journal of Operational Research, 131, no. 1, 2001, 119
Serigne Gueye, Philippe Michelon, ““Miniaturized” Linearizations for Quadratic 0/1 Problems”, Ann Oper Res, 140, no. 1, 2005, 235
C.C. de Souza, M. Laurent, “Some new classes of facets for the equicut polytope”, Discrete Applied Mathematics, 62, no. 1-3, 1995, 167
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