Mohammed Benayade, Bernard Fichet, Statistical Data Analysis Based on the L1-Norm and Related Methods, 2002, 367
F. Rendl, “Semidefinite relaxations for partitioning, assignment and ordering problems”, 4OR-Q J Oper Res, 10, № 4, 2012, 321
David Avis, 2866, Discrete and Computational Geometry, 2003, 51
Adam N. Letchford, Gerhard Reinelt, Hanna Seitz, Dirk Oliver Theis, “On a class of metrics related to graph layout problems”, Linear Algebra and its Applications, 433, № 11-12, 2010, 1760
Franz Rendl, “Semidefinite programming and combinatorial optimization”, Applied Numerical Mathematics, 29, № 3, 1999, 255
Laura Galli, Konstantinos Kaparis, Adam N. Letchford, “Complexity results for the gap inequalities for the max-cut problem”, Operations Research Letters, 40, № 3, 2012, 149
Elspeth Adams, Miguel F. Anjos, Franz Rendl, Angelika Wiegele, “A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems”, INFOR: Information Systems and Operational Research, 53, № 1, 2015, 40
Mathieu Dutour, “The six-dimensional Delaunay polytopes”, European Journal of Combinatorics, 25, № 4, 2004, 535
Michel Deza, Mathieu Dutour, Elena Panteleeva, “Small Cones of Oriented Semi-Metrics”, American Journal of Mathematical and Management Sciences, 22, № 3-4, 2002, 199
Poul Hjorth, Petr Lisonĕk, Steen Markvorsen, Carsten Thomassen, “Finite metric spaces of strictly negative type”, Linear Algebra and its Applications, 270, № 1-3, 1998, 255