{"id":"https://openalex.org/W4387578757","doi":"https://doi.org/10.1007/s10107-023-02021-8","title":"Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming","display_name":"Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming","publication_year":2023,"publication_date":"2023-10-12","ids":{"openalex":"https://openalex.org/W4387578757","doi":"https://doi.org/10.1007/s10107-023-02021-8"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-023-02021-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-02021-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02021-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02021-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357817","display_name":"Veronica Piccialli","orcid":"https://orcid.org/0000-0002-3357-9608"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Veronica Piccialli","raw_affiliation_strings":["Department of Computer, Control and Management Engineering, Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-3357-9608","affiliations":[{"raw_affiliation_string":"Department of Computer, Control and Management Engineering, Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083536934","display_name":"Antonio M. Sudoso","orcid":"https://orcid.org/0000-0002-2936-9931"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Antonio M. Sudoso","raw_affiliation_strings":["Department of Computer, Control and Management Engineering, Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-2936-9931","affiliations":[{"raw_affiliation_string":"Department of Computer, Control and Management Engineering, Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068357817"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":1.5259,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80229943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"211","issue":"1-2","first_page":"245","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10057","display_name":"Face and Expression Recognition","score":0.9645000100135803,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.8651137351989746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6806008815765381},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6285926699638367},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6192381381988525},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6042210459709167},{"id":"https://openalex.org/keywords/explained-sum-of-squares","display_name":"Explained sum of squares","score":0.5621452927589417},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5576316714286804},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5437355041503906},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5263549089431763},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4411345422267914},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.4296726584434509},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.41930192708969116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35705816745758057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24127823114395142},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.07400131225585938}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8651137351989746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6806008815765381},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6285926699638367},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6192381381988525},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6042210459709167},{"id":"https://openalex.org/C49847556","wikidata":"https://www.wikidata.org/wiki/Q3964631","display_name":"Explained sum of squares","level":2,"score":0.5621452927589417},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5576316714286804},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5437355041503906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5263549089431763},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4411345422267914},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.4296726584434509},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.41930192708969116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35705816745758057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24127823114395142},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.07400131225585938},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-023-02021-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-02021-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02021-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1690986","is_oa":true,"landing_page_url":"https://hdl.handle.net/11573/1690986","pdf_url":"https://iris.uniroma1.it/bitstream/11573/1690986/1/Piccialli_Global_2023.pdf","source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10107-023-02021-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-02021-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-02021-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387578757.pdf"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W97540112","https://openalex.org/W302081218","https://openalex.org/W765936379","https://openalex.org/W861814484","https://openalex.org/W1457372680","https://openalex.org/W1594924988","https://openalex.org/W1861508522","https://openalex.org/W1963753244","https://openalex.org/W1968876140","https://openalex.org/W1975552235","https://openalex.org/W1980317569","https://openalex.org/W1982831910","https://openalex.org/W1986219860","https://openalex.org/W1986790896","https://openalex.org/W2008091526","https://openalex.org/W2013153664","https://openalex.org/W2028920274","https://openalex.org/W2061830070","https://openalex.org/W2068487168","https://openalex.org/W2078992232","https://openalex.org/W2086959852","https://openalex.org/W2105543877","https://openalex.org/W2131929195","https://openalex.org/W2134089414","https://openalex.org/W2142333440","https://openalex.org/W2150593711","https://openalex.org/W2158898601","https://openalex.org/W2170006979","https://openalex.org/W2276842561","https://openalex.org/W2669673144","https://openalex.org/W2896609309","https://openalex.org/W2912522929","https://openalex.org/W2940320374","https://openalex.org/W2963103132","https://openalex.org/W2963301123","https://openalex.org/W2963602704","https://openalex.org/W2963751831","https://openalex.org/W2963774730","https://openalex.org/W2963814147","https://openalex.org/W2987536913","https://openalex.org/W2995073168","https://openalex.org/W3021268733","https://openalex.org/W3029646883","https://openalex.org/W3089750468","https://openalex.org/W3104719376","https://openalex.org/W3120916806","https://openalex.org/W3125711631","https://openalex.org/W3158016150","https://openalex.org/W3168308253","https://openalex.org/W3189663130","https://openalex.org/W3199460270","https://openalex.org/W3217296984","https://openalex.org/W4214500875"],"related_works":["https://openalex.org/W2493494838","https://openalex.org/W2005926129","https://openalex.org/W2061573764","https://openalex.org/W2963700124","https://openalex.org/W4297923520","https://openalex.org/W2255015247","https://openalex.org/W2624196447","https://openalex.org/W2077924482","https://openalex.org/W2964309041","https://openalex.org/W4298221171"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"minimum":[2],"sum-of-squares":[3],"clustering":[4],"(MSSC),":[5],"or":[6],"k-means":[7],"type":[8],"clustering,":[9],"has":[10],"been":[11],"recently":[12,67],"extended":[13],"to":[14,28,50],"exploit":[15],"prior":[16],"knowledge":[17,25],"on":[18,46],"the":[19,47,52,56,62,103,107,116,134,137,141,145,157,160,171,177],"cardinality":[20],"of":[21,109,136,159,182],"each":[22,165],"cluster.":[23],"Such":[24],"is":[26],"used":[27,83],"increase":[29],"performance":[30],"as":[31,33],"well":[32],"solution":[34,158],"quality.":[35],"In":[36,111],"this":[37,79],"paper,":[38],"we":[39,60,93,114,132,149],"propose":[40],"a":[41,85,95,124,151],"global":[42],"optimization":[43],"approach":[44],"based":[45],"branch-and-cut":[48,86],"technique":[49],"solve":[51],"cardinality-constrained":[53],"MSSC.":[54],"For":[55,144],"lower":[57],"bound":[58,117],"routine,":[59],"use":[61],"semidefinite":[63],"programming":[64],"(SDP)":[65],"relaxation":[66,80,98,162],"proposed":[68,172],"by":[69,118,190],"Rujeerapaiboon":[70],"et":[71],"al.":[72],"(SIAM":[73],"J":[74],"Optim":[75],"29(2):1211\u20131239,":[76],"2019).":[77],"However,":[78],"can":[81],"be":[82],"in":[84,140],"method":[87],"only":[88],"for":[89,176],"small-size":[90],"instances.":[91],"Therefore,":[92],"derive":[94],"new":[96],"SDP":[97,161],"that":[99,155,170],"scales":[100],"better":[101],"with":[102],"instance":[104],"size":[105,183],"and":[106],"number":[108],"clusters.":[110],"both":[112],"cases,":[113],"strengthen":[115],"adding":[119],"polyhedral":[120],"cuts.":[121],"Benefiting":[122],"from":[123],"tailored":[125],"branching":[126],"strategy":[127],"which":[128],"enforces":[129],"pairwise":[130],"constraints,":[131],"reduce":[133],"complexity":[135],"problems":[138],"arising":[139],"children":[142],"nodes.":[143],"upper":[146],"bound,":[147],"instead,":[148],"present":[150],"local":[152],"search":[153],"procedure":[154],"exploits":[156],"solved":[163,189],"at":[164],"node.":[166],"Computational":[167],"results":[168],"show":[169],"algorithm":[173],"globally":[174],"solves,":[175],"first":[178],"time,":[179],"real-world":[180],"instances":[181],"10":[184],"times":[185],"larger":[186],"than":[187],"those":[188],"state-of-the-art":[191],"exact":[192],"methods.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}
