[1] David Alvarez-Melis and Tommi S Jaakkola. Gromov-Wasserstein alignment of word embedding spaces. arXiv preprint arXiv:1809.00013, 2018.
[2] Florian Beier, Robert Beinert, and Gabriele Steidl. On a linear Gromov-Wasserstein distance. IEEE Transactions on Image Processing, 31:7292-7305, 2022.
[3] Nicolas Bonneel, Michiel Van De Panne, Sylvain Paris, and Wolfgang Heidrich. Displacement interpolation using lagrangian mass transport. In Proceedings of the 2011 SIGGRAPH Asia conference, pages 1-12, 2011.
[4] Rainer Burkard, Mauro Dell'Amico, and Silvano Martello. Assignment problems: revised reprint. SIAM, 2012.
[5] Rainer E Burkard, Eranda Cela, Panos M Pardalos, and Leonidas S Pitsoulis. The quadratic assignment problem. In Handbook of combinatorial optimization, pages 1713-1809. Springer, 1998.
[6] Marco Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems, 26:2292-2300, 2013.
[7] Pinar Demetci, Rebecca Santorella, Björn Sandstede, William Stafford Noble, and Ritambhara Singh. Gromov-Wasserstein optimal transport to align single-cell multi-omics data. *BioRxiv*, pages 2020–04, 2020.
[8] Li Deng. The MNIST database of handwritten digit images for machine learning research [best of the web]. IEEE signal processing magazine, 29(6):141-142, 2012.
[9] Danielle Ezuz, Justin Solomon, Vladimir G Kim, and Mirela Ben-Chen. Gwcnn: A metric alignment layer for deep shape analysis. Computer Graphics Forum, 36(5):49-57, 2017.
[10] Christodoulos A Floudas. Deterministic global optimization: theory, methods and applications, volume 37. Springer Science & Business Media, 2013.
[11] Michael Friesen. Low rank quadratic assignment problem: Formulations and experimental analysis. PhD thesis, Science: Department of Mathematics, 2019.
[12] Ralph E Gomory. Solving linear programming problems in integers. Combinatorial Analysis, 10:211-215, 1960.
[13] Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2023.
[14] Tjalling C Koopmans and Martin Beckmann. Assignment problems and the location of economic activities. Econometrica: journal of the Econometric Society, pages 53-76, 1957.
[15] Facundo Memoli. On the use of Gromov-Hausdorff distances for shape comparison. In M. Botsch, R. Pajarola, B. Chen, and M. Zwicker, editors, Eurographics Symposium on Point-Based Graphics. The Eurographics Association, 2007.
[16] Facundo Memoli. Gromov-Hausdorff distances in Euclidean spaces. In 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, pages 1-8. IEEE, 2008.
[17] Facundo Memoli. Gromov-Wasserstein distances and the metric approach to object matching. Foundations of computational mathematics, 11(4):417-487, 2011.
[18] J.B. Orlin. A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming, 78(2):109-129, 1997.
[19] Panos M Pardalos and Stephen A Vavasis. Quadratic programming with one negative eigenvalue is NP-hard. Journal of Global optimization, 1(1):15-22, 1991.
[20] Gabriel Peyré, Marco Cuturi, and Justin Solomon. Gromov-Wasserstein averaging of kernel and distance matrices. In International Conference on Machine Learning, pages 2664-2672. PMLR, 2016.