{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T06:51:18Z","timestamp":1768978278740,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T00:00:00Z","timestamp":1472169600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0065-1","type":"journal-article","created":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T05:29:35Z","timestamp":1472189375000},"page":"71-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An exact semidefinite programming approach for the max-mean dispersion problem"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1886-8073","authenticated-orcid":false,"given":"Michele","family":"Garraffa","sequence":"first","affiliation":[]},{"given":"Federico","family":"Della Croce","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Salassa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,26]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1993","unstructured":"Alizadeh F (1993) Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 5:13\u201351","journal-title":"SIAM J Optim"},{"key":"65_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10107-013-0690-8","volume":"146","author":"P Amaral","year":"2014","unstructured":"Amaral P, Bomze IM, Judice J (2014) Copositivity and constrained fractional quadratic problems. Math Prog 146:325\u2013350","journal-title":"Math Prog"},{"key":"65_CR3","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers B (1999) CSDP, A C library for semidefinite programming. Optim Methods Softw 11:613\u2013623","journal-title":"Optim Methods Softw"},{"key":"65_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"65_CR5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer S, Vandenbussche D (2008) A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math Prog 113:259\u2013282","journal-title":"Math Prog"},{"key":"65_CR6","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.knosys.2015.05.011","volume":"85","author":"R Carrasco","year":"2015","unstructured":"Carrasco R, Anthanh PT, Gallego M, Gort\u00e1zar F, Duarte A, Mar\u00ed R (2015) Tabu search for the max-mean dispersion problem. Knowl Based Syst 85:256\u2013264","journal-title":"Knowl Based Syst"},{"key":"65_CR7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230070405","volume":"7","author":"R Chandrasekaran","year":"1977","unstructured":"Chandrasekaran R (1977) Minimum ratio spanning trees. Networks 7:335\u2013342","journal-title":"Networks"},{"key":"65_CR8","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1109\/TSP.2009.2038963","volume":"58","author":"TH Chang","year":"2010","unstructured":"Chang TH, Hsin CW, Ma WK, Chi CY (2010) A linear fractional semidefinite relaxation approach to maximum-likelihood detection of higher-order qam ostbc in unknown channels. IEEE Trans signal process 58:2315\u20132326","journal-title":"IEEE Trans signal process"},{"key":"65_CR9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2016.01.003","volume":"71","author":"F Della Croce","year":"2016","unstructured":"Della Croce F, Garraffa M, Salassa F (2016) A hybrid three-phase approach for the max-mean dispersion problem. Comput Oper Res 71:16\u201322","journal-title":"Comput Oper Res"},{"key":"65_CR10","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1016\/j.cor.2008.09.007","volume":"36","author":"F Della Croce","year":"2009","unstructured":"Della Croce F, Grosso A, Locatelli M (2009) A heuristic approach for the max-min diversity problem based on max-clique. Comput Oper Res 36:2429\u20132433","journal-title":"Comput Oper Res"},{"key":"65_CR11","doi-asserted-by":"crossref","unstructured":"Frenk H, Schaible S (2009) Fractional Programming. Encyclopedia of Optimization 1080\u20131091","DOI":"10.1007\/978-0-387-74759-0_189"},{"key":"65_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10589-007-9161-6","volume":"44","author":"M Gallego","year":"2009","unstructured":"Gallego M, Duarte A, Laguna M, Mart\u00ed R (2009) Hybrid heuristics for the maximum diversity problem. Comput Optim Appl 44:411\u2013426","journal-title":"Comput Optim Appl"},{"key":"65_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0167-6377(96)00025-9","volume":"19","author":"JB Ghosh","year":"1996","unstructured":"Ghosh JB (1996) Computational aspects of the maximum diversity problem. Oper Res Lett 19:175\u2013181","journal-title":"Oper Res Lett"},{"key":"65_CR14","first-page":"109","volume":"19","author":"F Glover","year":"1998","unstructured":"Glover F, Kuo C-C, Dhir KS (1998) Heuristic algorithms for the maximum diversity problem. J Inf Optim Sci 19:109\u2013132","journal-title":"J Inf Optim Sci"},{"key":"65_CR15","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115\u20131145","journal-title":"J ACM"},{"key":"65_CR16","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"1999","unstructured":"Helmberg C, Rendl F (1999) A spectral bundle method for semidefinite programming. SIAM J Optim 10:673\u2013696","journal-title":"SIAM J Optim"},{"key":"65_CR17","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg C, Rendl F, Vanderbei RJ, Wolkowicz H (1996) An interior-point method for semidefinite programming. SIAM J Optim 6:342\u2013361","journal-title":"SIAM J Optim"},{"key":"65_CR18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1009898604624","volume":"4","author":"C Helmberg","year":"2000","unstructured":"Helmberg C, Rendl F, Weismantel R (2000) A semidefinite programming approach to the quadratic knapsack problem. J Comb Optim 4:197\u2013215","journal-title":"J Comb Optim"},{"key":"65_CR19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01584342","volume":"13","author":"H Ishii","year":"1976","unstructured":"Ishii H, Ibaraki T, Mine H (1976) Fractional knapsack problems. Math Prog 13:255\u2013271","journal-title":"Math Prog"},{"key":"65_CR20","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"CC Kuo","year":"1993","unstructured":"Kuo CC, Glover F, Dhir KS (1993) Analyzing and modeling the maximum diversity problem by zero-one programming. Decis Sci 24:1171\u20131185","journal-title":"Decis Sci"},{"key":"65_CR21","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-012-0604-1","volume":"136","author":"J Malick","year":"2012","unstructured":"Malick J, Roupin F (2012) Solving k-cluster problems to optimality with semidefinite programming. Math Prog 136:279\u2013300","journal-title":"Math Prog"},{"key":"65_CR22","unstructured":"Malick J, Krislock N, Roupin F BiqCrunch. http:\/\/lipn.univ-paris13.fr\/BiqCrunch\/"},{"key":"65_CR23","doi-asserted-by":"crossref","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, Pardo EG (2010) A branch and bound algorithm for the maximum diversity problem. Eur J Oper Res 200:36\u201344","journal-title":"Eur J Oper Res"},{"key":"65_CR24","doi-asserted-by":"crossref","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 EG (2013) Heuristics and metaheuristics for the maximum diversity problem. J Heuristics 19:591\u2013615","journal-title":"J Heuristics"},{"key":"65_CR25","doi-asserted-by":"crossref","first-page":"3091","DOI":"10.1016\/j.cor.2012.04.005","volume":"40","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed R, Sandoya F (2013) GRASP and path relinking for the equitable dispersion problem. Comput Oper Res 40:3091\u20133099","journal-title":"Comput Oper Res"},{"key":"65_CR26","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger D (2007) The quadratic knapsack problem\u2014a survey. Discret Appl Math 155:623\u2013648","journal-title":"Discret Appl Math"},{"key":"65_CR27","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2008.06.005","volume":"197","author":"OA Prokopyev","year":"2009","unstructured":"Prokopyev OA, Kong N, Martinez-Torres DL (2009) The equitable dispersion problem. Eur J Oper Res 197:59\u201367","journal-title":"Eur J Oper Res"},{"key":"65_CR28","doi-asserted-by":"crossref","unstructured":"Radzik T (2013) Fractional combinatorialoptimization. Handbook of combinatorial optimization 1311\u20131355","DOI":"10.1007\/978-1-4419-7997-1_62"},{"key":"65_CR29","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"MGC Resende","year":"2010","unstructured":"Resende MGC, Mart\u00ed R, Gallego M, Duarte A (2010) GRASP and path relinking for the max-min diversity problem. Comput Oper Res 37:498\u2013508","journal-title":"Comput Oper Res"},{"key":"65_CR30","doi-asserted-by":"crossref","unstructured":"Sandoya F, Aceves R (2013) Grasp and path relinking to solve the problem of selecting efficient work teams. Recent advances on meta-heuristics and their application to real scenarios. INTECH pp 25\u201352","DOI":"10.5772\/53700"},{"key":"65_CR31","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10732-007-9010-x","volume":"13","author":"GC Silva","year":"2007","unstructured":"Silva GC, de Andrade MRQ, Ochi LS, Martins SL, Plastino A (2007) New heuristics for the maximum diversity problem. J Heuristics 13:315\u2013336","journal-title":"J Heuristics"},{"key":"65_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional programming: theory, methods, and applications","author":"IM Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian IM (1997) Fractional programming: theory, methods, and applications. Kluwer Academic Publishers, Dordrecht"},{"issue":"2","key":"65_CR33","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math Prog 103(2):225\u2013249","journal-title":"Math Prog"},{"key":"65_CR34","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.cor.2016.02.016","volume":"72","author":"L Xiangjing","year":"2016","unstructured":"Xiangjing L, Jin-Kao H (2016) A tabu search based memetic algorithm for the max-mean dispersion problem. Comput Oper Res 72:118\u2013127","journal-title":"Comput Oper Res"},{"key":"65_CR35","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q Zhao","year":"1998","unstructured":"Zhao Q, Karisch S, Rendl F, Wolkowicz H (1998) Semidefinite programming relaxations for the quadratic assignment problem. J Combin Optim 2:71\u2013109","journal-title":"J Combin Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0065-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0065-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0065-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0065-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T20:06:21Z","timestamp":1568318781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0065-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,26]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["65"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0065-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,26]]}}}