1. Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., Katzgraber, H.: Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys. 7, 48 (2019). https://doi.org/10.3389/fphy.2019.00048
2. Bauckhage, C., Piatkowski, N., Sifa, R., Hecker, D., Wrobel, S.: A QUBO formulation of the k-medoids problem. In: Jäschke, R., Weidlich, M. (eds.) Proceedings of the Conference on Lernen, Wissen, Daten, Analysen, CEUR Workshop Proceedings, Berlin, Germany, 30 September–2 October 2019, vol. 2454, pp. 54–63. CEUR-WS.org (2019). http://ceur-ws.org/Vol-2454/paper_39.pdf
3. Burt, R.: Positions in networks. Soc. Forces 55(1), 93–122 (1976)
4. Camby, E., Caporossi, G.: The extended Jaccard distance in complex networks. Les Cahiers du GERAD G-2017-77 (September 2017)
5. Fan, N., Pardalos, P.: Linear and quadratic programming approaches for the general graph partitioning problem. J. Glob. Optim. 48(1), 57–71 (2010). https://doi.org/10.1007/s10898-009-9520-1