André R. S. Amaral, Adam N. Letchford, “A polyhedral approach to the single row facility layout problem”, Math. Program., 141, № 1-2, 2013, 453
David Avis, David Bremner, “Sparktope: linear programs from algorithms”, Optimization Methods and Software, 37, № 3, 2022, 954
Claudson F. Bornstein, Santosh Vempala, 2286, LATIN 2002: Theoretical Informatics, 2002, 516
Concepts of Combinatorial Optimization, 2014, 339
ANTHONY WESTON, “OPTIMAL LOWER BOUND ON THE SUPREMAL STRICT p-NEGATIVE TYPE OF A FINITE METRIC SPACE”, Bull. Aust. Math. Soc., 80, № 3, 2009, 486
Miguel F. Anjos, Frauke Liers, 166, Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, 849
Franz Rendl, Giovanni Rinaldi, Angelika Wiegele, “Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations”, Math. Program., 121, № 2, 2010, 307
Aristides Gionis, Heikki Mannila, Panayiotis Tsaparas, “Clustering aggregation”, ACM Trans. Knowl. Discov. Data, 1, № 1, 2007, 4
Jeff Edmonds, “Embedding into l ∞ 2 Is Easy, Embedding into l ∞ 3 Is NP-Complete”, Discrete Comput Geom, 39, № 4, 2008, 747
Barbara Amaral, Marcelo Terra Cunha, “On geometrical aspects of the graph approach to contextuality”, Phil. Trans. R. Soc. A., 382, № 2268, 2024, 20230008