- Laura Galli, Adam N. Letchford, “Small bipartite subgraph polytopes”, Operations Research Letters, 38, № 5, 2010, 337
![https://doi.org/10.1016/j.orl.2010.05.004 crossref](/refsvg/svg/crossref.svg)
- Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2014, 131
![https://doi.org/10.1002/9781119005353.ch6 crossref](/refsvg/svg/crossref.svg)
- C. De Simone, G. Rinaldi, “A cutting plane algorithm for the max-cut problem”, Optimization Methods and Software, 3, № 1-3, 1994, 195
![https://doi.org/10.1080/10556789408805564 crossref](/refsvg/svg/crossref.svg)
- Sunil Chopra, M.R. Rao, “Facets of the k-partition polytope”, Discrete Applied Mathematics, 61, № 1, 1995, 27
![https://doi.org/10.1016/0166-218X(93)E0175-X crossref](/refsvg/svg/crossref.svg)
- Michel Deza, Monique Laurent, “Facets for the cut cone II: Clique-web inequalities”, Mathematical Programming, 56, № 1-3, 1992, 161
![https://doi.org/10.1007/BF01580898 crossref](/refsvg/svg/crossref.svg)
- Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, № 2, 1994, 191
![https://doi.org/10.1016/0377-0427(94)90020-5 crossref](/refsvg/svg/crossref.svg)
- Antoine Deza, Michel Deza, Polytopes: Abstract, Convex and Computational, 1994, 359
![https://doi.org/10.1007/978-94-011-0924-6_16 crossref](/refsvg/svg/crossref.svg)
- Adam N. Letchford, Michael M. Sørensen, 5035, Integer Programming and Combinatorial Optimization, 2008, 125
![https://doi.org/10.1007/978-3-540-68891-4_9 crossref](/refsvg/svg/crossref.svg)
- John E. Mitchell, Panos M. Pardalos, Mauricio G. C. Resende, Handbook of Combinatorial Optimization, 1998, 189
![https://doi.org/10.1007/978-1-4613-0303-9_4 crossref](/refsvg/svg/crossref.svg)
- Michel Deza, Monique Laurent, “Hypercube embedding of generalized bipartite metrics”, Discrete Applied Mathematics, 56, № 2-3, 1995, 215
![https://doi.org/10.1016/0166-218X(94)00087-T crossref](/refsvg/svg/crossref.svg)