- Michel Marie Deza, Elena Deza, Encyclopedia of Distances, 2014, 95
- M.J. Wainwright, T.S. Jaakkola, A.S. Willsky, “MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming”, IEEE Trans. Inform. Theory, 51, no. 11, 2005, 3697
- Frank Plastria, “Asymmetric distances, semidirected networks and majority in Fermat–Weber problems”, Ann Oper Res, 167, no. 1, 2009, 121
- T.-H. Hubert Chan, Khaled Elbassioni, “A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics”, Discrete Comput Geom, 46, no. 4, 2011, 704
- Adam N. Letchford, Michael M. Sørensen, 5035, Integer Programming and Combinatorial Optimization, 2008, 125
- Henry Wolkowicz, “Solving semidefinite programs using preconditioned conjugate gradients”, Optimization Methods and Software, 19, no. 6, 2004, 653
- Philipp Hungerländer, Franz Rendl, “A computational study and survey of methods for the single-row facility layout problem”, Comput Optim Appl, 55, no. 1, 2013, 1
- Pavel Chebotarev, Michel Deza, Distance Geometry, 2013, 121
- Oleksiy Dovgoshey, Olli Martio, Matti Vuorinen, “Metrization of Weighted Graphs”, Ann. Comb., 17, no. 3, 2013, 455
- Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller, “Unavoidable Minors for Graphs with Large $\ell _p$-Dimension”, Discrete Comput Geom, 66, no. 1, 2021, 301