{"id":"https://openalex.org/W2508920162","doi":"https://doi.org/10.1007/s10878-016-0065-1","title":"An exact semidefinite programming approach for the max-mean dispersion problem","display_name":"An exact semidefinite programming approach for the max-mean dispersion problem","publication_year":2016,"publication_date":"2016-08-26","ids":{"openalex":"https://openalex.org/W2508920162","doi":"https://doi.org/10.1007/s10878-016-0065-1","mag":"2508920162"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-016-0065-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-016-0065-1","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085985395","display_name":"Michele Garraffa","orcid":"https://orcid.org/0000-0002-1886-8073"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Michele Garraffa","raw_affiliation_strings":["DAUIN, Politecnico di Torino, Corso Duca degli Abruzzi, 24, 10129, Torino, Italy"],"affiliations":[{"raw_affiliation_string":"DAUIN, Politecnico di Torino, Corso Duca degli Abruzzi, 24, 10129, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075438770","display_name":"Federico Della Croce","orcid":"https://orcid.org/0000-0003-2897-183X"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Della Croce","raw_affiliation_strings":["DAUIN, Politecnico di Torino, Corso Duca degli Abruzzi, 24, 10129, Torino, Italy"],"affiliations":[{"raw_affiliation_string":"DAUIN, Politecnico di Torino, Corso Duca degli Abruzzi, 24, 10129, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014990348","display_name":"Fabio Salassa","orcid":"https://orcid.org/0000-0002-9698-6892"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabio Salassa","raw_affiliation_strings":["DAUIN, Politecnico di Torino, Corso Duca degli Abruzzi, 24, 10129, Torino, Italy"],"affiliations":[{"raw_affiliation_string":"DAUIN, Politecnico di Torino, Corso Duca degli Abruzzi, 24, 10129, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085985395"],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.8465,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78720118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"34","issue":"1","first_page":"71","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8218928575515747},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.784559965133667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7693580389022827},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6445482969284058},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.600616455078125},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5845041871070862},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.53221595287323},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5170872211456299},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.43705302476882935},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4301590323448181},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41373807191848755},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41363489627838135},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3242393732070923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3178403079509735},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.29804107546806335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18294525146484375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09656232595443726}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8218928575515747},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.784559965133667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7693580389022827},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6445482969284058},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.600616455078125},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5845041871070862},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.53221595287323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5170872211456299},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.43705302476882935},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4301590323448181},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41373807191848755},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41363489627838135},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3242393732070923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3178403079509735},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.29804107546806335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18294525146484375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09656232595443726},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-016-0065-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-016-0065-1","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0065-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-016-0065-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6899999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320311034","display_name":"Technische Universit\u00e4t Chemnitz","ror":"https://ror.org/00a208s56"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1579805471","https://openalex.org/W1595903022","https://openalex.org/W1963753244","https://openalex.org/W1985123706","https://openalex.org/W1985783557","https://openalex.org/W1991805259","https://openalex.org/W1999613943","https://openalex.org/W2004407575","https://openalex.org/W2026342695","https://openalex.org/W2027034184","https://openalex.org/W2038611554","https://openalex.org/W2046706749","https://openalex.org/W2051306216","https://openalex.org/W2066173631","https://openalex.org/W2067171884","https://openalex.org/W2074629033","https://openalex.org/W2074717268","https://openalex.org/W2082782506","https://openalex.org/W2087999447","https://openalex.org/W2089088038","https://openalex.org/W2089327800","https://openalex.org/W2093258914","https://openalex.org/W2095393540","https://openalex.org/W2108403327","https://openalex.org/W2128202699","https://openalex.org/W2130980674","https://openalex.org/W2153871898","https://openalex.org/W2154629615","https://openalex.org/W2164719474","https://openalex.org/W2239027276","https://openalex.org/W2292206207","https://openalex.org/W2296319761","https://openalex.org/W4233352824","https://openalex.org/W4236268295","https://openalex.org/W4250589301","https://openalex.org/W4253679144"],"related_works":["https://openalex.org/W2362705850","https://openalex.org/W2078979423","https://openalex.org/W2513180016","https://openalex.org/W2152242686","https://openalex.org/W2353517195","https://openalex.org/W2366269287","https://openalex.org/W2920857515","https://openalex.org/W3000089047","https://openalex.org/W2085427851","https://openalex.org/W2109026705"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}