M. M. Mestechkin, “Diagonal N-representability as a method for solving the representability problem”, Russ. J. Phys. Chem. B, 11, no. 2, 2017, 208
Timotej Hrga, Janez Povh, “Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B”, Optim Lett, 17, no. 5, 2023, 1201
Cristina Bazgan, Zsolt Tuza, “Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3”, Journal of Discrete Algorithms, 6, no. 3, 2008, 510
Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani, “Learning representations from dendrograms”, Mach Learn, 109, no. 9-10, 2020, 1779
Michel Deza, Monique Laurent, “Applications of cut polyhedra — II”, Journal of Computational and Applied Mathematics, 55, no. 2, 1994, 217
Christoph Helmberg, Franz Rendl, “Solving quadratic (0,1)-problems by semidefinite programs and cutting planes”, Mathematical Programming, 82, no. 3, 1998, 291
Abraham P. Punnen, Renata Sotirov, The Quadratic Unconstrained Binary Optimization Problem, 2022, 139
Carolina Salto, Enrique Alba, “Designing heterogeneous distributed GAs by efficiently self-adapting the migration period”, Appl Intell, 36, no. 4, 2012, 800
Paradigms of Combinatorial Optimization, 2014, 707
Tim Römer, Sara Saeedi Madani, “Cycle algebras and polytopes of matroids”, Journal of Pure and Applied Algebra, 228, no. 6, 2024, 107574