Laura Galli, Adam N. Letchford, “Small bipartite subgraph polytopes”, Operations Research Letters, 38, № 5, 2010, 337
Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2014, 131
C. De Simone, G. Rinaldi, “A cutting plane algorithm for the max-cut problem”, Optimization Methods and Software, 3, № 1-3, 1994, 195
Sunil Chopra, M.R. Rao, “Facets of the k-partition polytope”, Discrete Applied Mathematics, 61, № 1, 1995, 27
Michel Deza, Monique Laurent, “Facets for the cut cone II: Clique-web inequalities”, Mathematical Programming, 56, № 1-3, 1992, 161
Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, № 2, 1994, 191
Antoine Deza, Michel Deza, Polytopes: Abstract, Convex and Computational, 1994, 359
Adam N. Letchford, Michael M. Sørensen, 5035, Integer Programming and Combinatorial Optimization, 2008, 125
John E. Mitchell, Panos M. Pardalos, Mauricio G. C. Resende, Handbook of Combinatorial Optimization, 1998, 189
Michel Deza, Monique Laurent, “Hypercube embedding of generalized bipartite metrics”, Discrete Applied Mathematics, 56, № 2-3, 1995, 215