1. Alidaee, B., Wang, H.: A note on heuristic approach based on UBQP formulation of the maximum diversity problem. J. Oper. Res. Soc. 68(1), 102–110 (2017)
2. Besanko, D., Perry, M.K., Spady, R.H.: The logit model of monopolistic competition: brand diversity. J. Ind. Econ. pp. 397–415 (1990)
3. Cevallos, A., Eisenbrand, F., Morell, S.: Diversity maximization in doubling metrics. In: Hsu, W.L., Lee, D.T., Liao, C.S. (eds) 29th International Symposium on Algorithms and Computation (ISAAC 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 123, pp. 33:1–33:12. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)
4. Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-Sum Diversity Via Convex Programming. In: S. Fekete, A. Lubiw (eds.) 32nd International Symposium on Computational Geometry (SoCG 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 51, pp. 26:1–26:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016)
5. Duarte, A., Martí, R.: Tabu search and grasp for the maximum diversity problem. Eur. J. Oper. Res. 178(1), 71–84 (2007)