{"id":"https://openalex.org/W4413508008","doi":"https://doi.org/10.1007/s11590-025-02235-z","title":"A cutting plane algorithm for globally solving low-dimensional k-means problems","display_name":"A cutting plane algorithm for globally solving low-dimensional k-means problems","publication_year":2025,"publication_date":"2025-08-25","ids":{"openalex":"https://openalex.org/W4413508008","doi":"https://doi.org/10.1007/s11590-025-02235-z"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-025-02235-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-025-02235-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-025-02235-z.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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/s11590-025-02235-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066995481","display_name":"Martin Ryner","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Martin Ryner","raw_affiliation_strings":["Division of Numerical Analysis, Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Lindstedtv\u00e4gen 25, 100 44, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Numerical Analysis, Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Lindstedtv\u00e4gen 25, 100 44, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006006057","display_name":"Jan Kronqvist","orcid":"https://orcid.org/0000-0003-0299-5745"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Jan Kronqvist","raw_affiliation_strings":["Division of Numerical Analysis, Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Lindstedtv\u00e4gen 25, 100 44, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0299-5745","affiliations":[{"raw_affiliation_string":"Division of Numerical Analysis, Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Lindstedtv\u00e4gen 25, 100 44, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065730184","display_name":"Johan Karlsson","orcid":"https://orcid.org/0000-0001-5158-9255"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan Karlsson","raw_affiliation_strings":["Division of Numerical Analysis, Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Lindstedtv\u00e4gen 25, 100 44, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Numerical Analysis, Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Lindstedtv\u00e4gen 25, 100 44, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006006057"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38476563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"8","first_page":"1539","last_page":"1556"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9988999962806702,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9945999979972839,"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/computational-intelligence","display_name":"Computational intelligence","score":0.7247861623764038},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5930250287055969},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5366244912147522},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5174716114997864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4104998707771301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38068386912345886},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1874176263809204},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.16907256841659546},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.09173202514648438}],"concepts":[{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.7247861623764038},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5930250287055969},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5366244912147522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5174716114997864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4104998707771301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38068386912345886},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1874176263809204},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.16907256841659546},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.09173202514648438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-025-02235-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-025-02235-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-025-02235-z.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s11590-025-02235-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-025-02235-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-025-02235-z.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5094820288","display_name":null,"funder_award_id":"2022-03502","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G8463015521","display_name":null,"funder_award_id":"2020-03454","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322509","display_name":"Kungliga Tekniska H\u00f6gskolan","ror":"https://ror.org/026vcq606"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413508008.pdf","grobid_xml":"https://content.openalex.org/works/W4413508008.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1530581016","https://openalex.org/W1858333687","https://openalex.org/W1998905999","https://openalex.org/W2029241756","https://openalex.org/W2077410003","https://openalex.org/W2100485099","https://openalex.org/W2134092250","https://openalex.org/W2142838865","https://openalex.org/W2149596792","https://openalex.org/W2150593711","https://openalex.org/W2170006979","https://openalex.org/W2199495299","https://openalex.org/W2737166611","https://openalex.org/W2788332637","https://openalex.org/W2801721500","https://openalex.org/W2964283450","https://openalex.org/W2979506454","https://openalex.org/W3099245869","https://openalex.org/W3158016150","https://openalex.org/W3215408481","https://openalex.org/W4250589301","https://openalex.org/W4315491629","https://openalex.org/W4411131366","https://openalex.org/W6888847952","https://openalex.org/W6907783960","https://openalex.org/W6963849513"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W1513565830","https://openalex.org/W2080278356","https://openalex.org/W4394660760","https://openalex.org/W3012113686","https://openalex.org/W3036780229","https://openalex.org/W1996239617","https://openalex.org/W3197304203"],"abstract_inverted_index":{"Abstract":[0],"Clustering":[1],"is":[2,18,28,50],"one":[3,19],"of":[4,20,24,31,106,130],"the":[5,21,35,44,59,81,86,154],"most":[6,22],"fundamental":[7],"tools":[8],"in":[9,51],"data":[10,66,94,163],"science":[11],"and":[12,15,67,84,100,118,156,164],"machine":[13],"learning,":[14],"k-means":[16,36,60],"clustering":[17],"common":[23],"such":[25],"methods.":[26],"There":[27],"a":[29,40,71,114,119,128,141],"variety":[30],"approximate":[32],"algorithms":[33],"for":[34,62,91,103],"problem,":[37],"but":[38],"only":[39],"few":[41],"methods":[42,148],"compute":[43],"globally":[45],"optimal":[46],"solution,":[47],"as":[48,70],"it":[49,69],"general":[52],"NP-hard.":[53],"In":[54],"this":[55,104],"paper,":[56],"we":[57,137,157],"consider":[58],"problem":[61,87,117],"instances":[63],"with":[64,96,134],"low-dimensional":[65,82],"formulate":[68],"structured":[72],"concave":[73,116],"assignment":[74,124],"problem.":[75,125],"This":[76,126],"allows":[77],"us":[78],"to":[79,88,140,152],"exploit":[80],"structure":[83],"solve":[85],"global":[89,150],"optimality":[90,143],"very":[92],"large":[93,120],"sets":[95],"several":[97],"clusters,":[98],"complementing":[99],"outperforming":[101],"state-of-the-art":[102],"class":[105],"problems.":[107],"The":[108,145],"method":[109],"builds":[110],"on":[111,161],"iteratively":[112],"solving":[113],"small":[115],"linear":[121],"programming":[122],"or":[123],"gives":[127],"sequence":[129],"feasible":[131],"solutions":[132],"along":[133],"bounds,":[135],"which":[136],"show":[138],"converges":[139],"zero":[142],"gap.":[144],"paper":[146],"combines":[147],"from":[149],"optimization":[151],"accelerate":[153],"procedure,":[155],"provide":[158],"numerical":[159],"results":[160],"synthetic":[162],"real-world":[165],"data.":[166]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}