{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T21:02:55Z","timestamp":1785186175925,"version":"3.55.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11590-021-01719-y","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T13:28:22Z","timestamp":1615296502000},"page":"2879-2895","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["t-Linearization for the maximum diversity problem"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9415-450X","authenticated-orcid":false,"given":"Pablo","family":"Soares","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2962-2033","authenticated-orcid":false,"given":"Manoel","family":"Camp\u00ealo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,9]]},"reference":[{"issue":"1","key":"1719_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1057\/s41274-016-0031-4","volume":"68","author":"B Alidaee","year":"2017","unstructured":"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\u2013110 (2017)","journal-title":"J. Oper. Res. Soc."},{"key":"1719_CR2","doi-asserted-by":"crossref","unstructured":"Besanko, D., Perry, M.K., Spady, R.H.: The logit model of monopolistic competition: brand diversity. J. Ind. Econ. pp. 397\u2013415 (1990)","DOI":"10.2307\/2098347"},{"key":"1719_CR3","unstructured":"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\u201333:12. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)"},{"key":"1719_CR4","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-Sum Diversity Via Convex Programming. In: S.\u00a0Fekete, A.\u00a0Lubiw (eds.) 32nd International Symposium on Computational Geometry (SoCG 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a051, pp. 26:1\u201326:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016)"},{"issue":"1","key":"1719_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2006.01.021","volume":"178","author":"A Duarte","year":"2007","unstructured":"Duarte, A., Mart\u00ed, R.: Tabu search and grasp for the maximum diversity problem. Eur. J. Oper. Res. 178(1), 71\u201384 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1719_CR6","doi-asserted-by":"crossref","unstructured":"Eremeev, A.V., Kel\u2019manov, A.V., Kovalyov, M.Y., Pyatkin, A.V.: Maximum diversity problem with squared euclidean distance. In: International Conference on Mathematical Optimization Theory and Operations Research, pp. 541\u2013551. Springer (2019)","DOI":"10.1007\/978-3-030-22629-9_38"},{"issue":"1","key":"1719_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut, E.: The discrete p-dispersion problem. Eur. J. Oper. Res. 46(1), 48\u201360 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"1719_CR8","doi-asserted-by":"crossref","unstructured":"Erkut, E., Neuman, S.: Comparison of four models for dispersing facilities. INFOR: Inf. Syst. Oper. Res. 29(2), 68\u201386 (1991)","DOI":"10.1080\/03155986.1991.11732157"},{"issue":"1","key":"1719_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10479-018-3118-2","volume":"279","author":"F Furini","year":"2019","unstructured":"Furini, F., Traversi, E.: Theoretical and computational study of several linearisation techniques for binary quadratic problems. Ann. Oper. Res. 279(1), 387\u2013411 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"4\u20135","key":"1719_CR10","first-page":"423","volume":"6","author":"TV Ghyczy","year":"1985","unstructured":"Ghyczy, T.V.: Product diversity e proliferation as a new mode of competing in the motor car. Int. J. Veh. Des. 6(4\u20135), 423\u2013425 (1985)","journal-title":"Int. J. Veh. Des."},{"issue":"4","key":"1719_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22(4), 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"issue":"1","key":"1719_CR12","first-page":"109","volume":"19","author":"F Glover","year":"1998","unstructured":"Glover, F., Kuo, C.C., Dhir, K.S.: Heuristic algorithms for the maximum diversity problem. J. Inf. Optim. Sci. 19(1), 109\u2013132 (1998)","journal-title":"J. Inf. Optim. Sci."},{"issue":"1","key":"1719_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper. Res. 22(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"issue":"6","key":"1719_CR14","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/j.dam.2008.01.028","volume":"157","author":"S Gueye","year":"2009","unstructured":"Gueye, S., Michelon, P.: A linearization framework for unconstrained quadratic (0\u20131) problems. Discret. Appl. Math. 157(6), 1255\u20131266 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"1719_CR15","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"CC Kuo","year":"1993","unstructured":"Kuo, C.C., Glover, F., Dhir, K.S.: Analyzing and modeling the maximum diversity problem by zero-one programming. Decis. Sci. 24(6), 1171\u20131185 (1993)","journal-title":"Decis. Sci."},{"key":"1719_CR16","doi-asserted-by":"crossref","unstructured":"Lai, X., Hao, J., Yue, D., Gao, H.: Diversification-driven memetic algorithm for the maximum diversity problem. In: 2018 5th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS), pp. 310\u2013314. IEEE (2018)","DOI":"10.1109\/CCIS.2018.8691160"},{"issue":"5","key":"1719_CR17","first-page":"1769","volume":"13","author":"G Lin","year":"2017","unstructured":"Lin, G.: Solving the maximum diversity problem using simulated annealing based evolutionary algorithm. Int. J. Innov. Comput. Inf. Control 13(5), 1769\u20131776 (2017)","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"key":"1719_CR18","doi-asserted-by":"crossref","unstructured":"Macambira, E.M., Souza, C.C.D.: The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123(2), 346\u2013371 (2000)","DOI":"10.1016\/S0377-2217(99)00262-3"},{"issue":"1","key":"1719_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A.: A branch and bound algorithm for the maximum diversity problem. Eur. J. Oper. Res. 200(1), 36\u201344 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1719_CR20","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10732-011-9172-4","volume":"19","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A., Pardo, E.G.: Heuristics and metaheuristics for the maximum diversity problem. J. Heuristics 19(4), 591\u2013615 (2013)","journal-title":"J. Heuristics"},{"key":"1719_CR21","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A.: MDPLIB - Maximum Diversity Problem Library (2010). http:\/\/grafo.etsii.urjc.es\/optsicom\/mdp\/"},{"issue":"10","key":"1719_CR22","first-page":"89","volume":"117","author":"S McConnell","year":"1988","unstructured":"McConnell, S.: The new battle over immigration. Fortune 117(10), 89 (1988)","journal-title":"Fortune"},{"issue":"6","key":"1719_CR23","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1016\/0016-3287(87)90088-7","volume":"19","author":"D Pearce","year":"1987","unstructured":"Pearce, D.: Economics e genetic diversity. Futures 19(6), 710\u2013712 (1987)","journal-title":"Futures"},{"issue":"5","key":"1719_CR24","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1016\/j.cor.2004.09.033","volume":"33","author":"D Pisinger","year":"2006","unstructured":"Pisinger, D.: Upper bounds and exact algorithms for p-dispersion problems. Comput. Oper. Res. 33(5), 1380\u20131398 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"1719_CR25","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/110820762","volume":"22","author":"C Rodrigues","year":"2012","unstructured":"Rodrigues, C., Quadri, D., Michelon, P., Gueye, S.: 0\u20131 quadratic knapsack problems: an exact approach based on a t-linearization. SIAM J. Optim. 22(4), 1449\u20131468 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1719_CR26","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ejor.2019.03.047","volume":"278","author":"P San Segundo","year":"2019","unstructured":"San Segundo, P., Coniglio, S., Furini, F., Ljubi\u0107, I.: A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278(1), 76\u201390 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"1719_CR27","doi-asserted-by":"crossref","unstructured":"Silva, G.C., Ochi, L.S., Martins, S.L.: Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: International Workshop on Experimental and Efficient Algorithms, pp. 498\u2013512. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24838-5_37"},{"key":"1719_CR28","unstructured":"Swierenga, R.P.: Ethnicity in historical perspective. Social Science pp. 31\u201344 (1977)"},{"key":"1719_CR29","doi-asserted-by":"crossref","unstructured":"Vera, K., Lopez-Pires, F., Baran, B., Sandoya, F.: Maximum diversity problem. a multi-objective approach. CLEI Eletron. J. 21(2), 1\u201316 (2018)","DOI":"10.19153\/cleiej.21.2.2"},{"issue":"5","key":"1719_CR30","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/TEVC.2017.2674800","volume":"21","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Hao, J.K., Duval, B.: Opposition-based memetic search for the maximum diversity problem. IEEE Trans. Evol. Comput. 21(5), 731\u2013745 (2017)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01719-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01719-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01719-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:31:41Z","timestamp":1632447101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01719-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,9]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1719"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01719-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,9]]},"assertion":[{"value":"23 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}