Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2014, 131
Jürgen Herzog, Masoomeh Rahimbeigi, Tim Römer, “Classes of cut ideals and their Betti numbers”, São Paulo J. Math. Sci., 17, no. 1, 2023, 172
G. G. Guerreschi, A. Y. Matsuura, “QAOA for Max-Cut requires hundreds of qubits for quantum speed-up”, Sci Rep, 9, no. 1, 2019, 6903
George Christopher, Martin Farach, Michael Trick, 1136, Algorithms — ESA '96, 1996, 486
Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen, “Improved compact formulations for metric and cut polyhedra”, Electronic Notes in Discrete Mathematics, 52, 2016, 125
David Avis, Hiroshi Imai, Tsuyoshi Ito, “Generating facets for the cut polytope of a graph by triangular elimination”, Math. Program., 112, no. 2, 2007, 303
Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2013, 131
Mitra Koley, Tim Römer, “Seminormality, canonical modules, and regularity of cut polytopes”, Journal of Pure and Applied Algebra, 226, no. 1, 2022, 106797
Agnès Gorge, Abdel Lisser, Riadh Zorgati, “Generating cutting planes for the semidefinite relaxation of quadratic programs”, Computers & Operations Research, 55, 2015, 65
Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos, “A dynamic inequality generation scheme for polynomial programming”, Math. Program., 156, no. 1-2, 2016, 21