{"id":"https://openalex.org/W3004414331","doi":"https://doi.org/10.1109/ieem44572.2019.8978840","title":"A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem","display_name":"A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3004414331","doi":"https://doi.org/10.1109/ieem44572.2019.8978840","mag":"3004414331"},"language":"en","primary_location":{"id":"doi:10.1109/ieem44572.2019.8978840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-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/A5072687277","display_name":"Philipp Baumann","orcid":"https://orcid.org/0000-0002-3286-4474"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Philipp Baumann","raw_affiliation_strings":["University of Bern,Department of Business Administration,Bern,Switzerland,3012","Department of Business Administration, University of Bern, Bern, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Bern,Department of Business Administration,Bern,Switzerland,3012","institution_ids":["https://openalex.org/I118564535"]},{"raw_affiliation_string":"Department of Business Administration, University of Bern, Bern, Switzerland","institution_ids":["https://openalex.org/I118564535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072687277"],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":0.8348,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74782397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"335","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9922000169754028,"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/cluster-analysis","display_name":"Cluster analysis","score":0.8299864530563354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7269500494003296},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6127109527587891},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5615564584732056},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5210230350494385},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48746776580810547},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.48631414771080017},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4620157480239868},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.41180509328842163},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.3797658085823059},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34573882818222046},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34337249398231506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22998282313346863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17557036876678467}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8299864530563354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7269500494003296},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6127109527587891},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5615564584732056},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5210230350494385},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48746776580810547},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.48631414771080017},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4620157480239868},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.41180509328842163},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.3797658085823059},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34573882818222046},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34337249398231506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22998282313346863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17557036876678467},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ieem44572.2019.8978840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},{"id":"pmh:oai:boris.unibe.ch:138873","is_oa":false,"landing_page_url":"https://boris.unibe.ch/138873/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Baumann, Philipp (16 December 2019). A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem. In: IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). Macau. 15.-18.12.2019.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2283060","https://openalex.org/W1525976127","https://openalex.org/W2073459066","https://openalex.org/W2134089414","https://openalex.org/W2153386665","https://openalex.org/W2163494940","https://openalex.org/W2165558283","https://openalex.org/W2172264744","https://openalex.org/W2200281865","https://openalex.org/W2885000664","https://openalex.org/W2889505328","https://openalex.org/W2905872732","https://openalex.org/W4285719527","https://openalex.org/W6638973058","https://openalex.org/W6679849079"],"related_works":["https://openalex.org/W3146523624","https://openalex.org/W2160785859","https://openalex.org/W1525022337","https://openalex.org/W2188840951","https://openalex.org/W2171583777","https://openalex.org/W2186905933","https://openalex.org/W2969974905","https://openalex.org/W2040929534","https://openalex.org/W2555816786","https://openalex.org/W2390610678"],"abstract_inverted_index":{"The":[0,45,122],"k-means":[1,36,64],"algorithm":[2,37,65,107],"is":[3,48],"one":[4],"of":[5,34,62,73,84,97,116],"the":[6,12,22,35,63,93,98,117,143,148],"most":[7],"popular":[8],"clustering":[9,27,86,120],"algorithms":[10],"in":[11,147],"machine":[13],"learning":[14],"community.":[15],"Its":[16],"simplicity":[17],"and":[18,95],"scalability":[19],"make":[20],"it":[21,103],"primary":[23],"choice":[24],"for":[25,41,54,69,142],"many":[26],"applications.":[28],"We":[29,91],"introduce":[30],"here":[31],"a":[32,81,105,109],"variant":[33],"that":[38,66,112],"can":[39,77],"account":[40],"complex":[42],"side":[43],"constraints.":[44],"key":[46],"idea":[47],"to":[49,57,80,104],"use":[50],"binary":[51],"linear":[52],"programming":[53],"assigning":[55],"objects":[56],"clusters.":[58,135],"Unlike":[59],"existing":[60],"extensions":[61],"are":[67],"designed":[68],"accommodating":[70],"specific":[71],"types":[72],"constraints,":[74],"our":[75],"approach":[76,100,124],"be":[78],"applied":[79],"wide":[82],"range":[83],"constrained":[85],"problems":[87],"with":[88,131],"minor":[89],"modifications.":[90],"demonstrate":[92],"effectiveness":[94],"efficiency":[96],"proposed":[99,123],"by":[101],"comparing":[102],"state-of-the-art":[106],"on":[108,128],"test":[110,149],"set":[111],"comprises":[113],"18":[114],"instances":[115,130,146],"capacitated":[118],"centered":[119],"problem.":[121],"performed":[125],"particularly":[126],"well":[127],"large-sized":[129],"more":[132],"than":[133],"100":[134],"It":[136],"even":[137],"found":[138],"new":[139],"best-known":[140],"solutions":[141],"four":[144],"largest":[145],"set.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}