{"id":"https://openalex.org/W3110138576","doi":"https://doi.org/10.1109/codit49905.2020.9263846","title":"Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem","display_name":"Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem","publication_year":2020,"publication_date":"2020-06-29","ids":{"openalex":"https://openalex.org/W3110138576","doi":"https://doi.org/10.1109/codit49905.2020.9263846","mag":"3110138576"},"language":"en","primary_location":{"id":"doi:10.1109/codit49905.2020.9263846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit49905.2020.9263846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5044647341","display_name":"Mhand Hifi","orcid":"https://orcid.org/0000-0002-1031-7701"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Hifi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049285918","display_name":"Shohre Sadeghsa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Sadeghsa","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044647341"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7226,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78180551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1150","last_page":"1155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9805999994277954,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/rounding","display_name":"Rounding","score":0.9001031517982483},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.677313506603241},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6740102171897888},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.6677412390708923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47839462757110596},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35021281242370605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23848316073417664},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2152118980884552},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.05938899517059326}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.9001031517982483},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.677313506603241},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6740102171897888},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.6677412390708923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47839462757110596},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35021281242370605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23848316073417664},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2152118980884552},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.05938899517059326},{"id":"https://openalex.org/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit49905.2020.9263846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit49905.2020.9263846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 7th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03617889v1","is_oa":false,"landing_page_url":"https://u-picardie.hal.science/hal-03617889","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2020 7TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'20), VOL 1, Jun 2020, Prague, Czech Republic. pp.1150-1155","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1146855678","https://openalex.org/W1977415390","https://openalex.org/W1979423668","https://openalex.org/W2003331610","https://openalex.org/W2060322444","https://openalex.org/W2430721315","https://openalex.org/W2533881842","https://openalex.org/W2555367514","https://openalex.org/W2742076497"],"related_works":["https://openalex.org/W1571518467","https://openalex.org/W87991986","https://openalex.org/W2020291234","https://openalex.org/W2094520212","https://openalex.org/W2001850503","https://openalex.org/W1576801573","https://openalex.org/W2361460797","https://openalex.org/W2573131093","https://openalex.org/W2386949455","https://openalex.org/W2386767533"],"abstract_inverted_index":{"This":[0],"study":[1],"proposes":[2],"an":[3],"algorithm":[4,102,116],"based":[5],"upon":[6],"the":[7,11,19,36,41,55,99,127,139,144],"rounding":[8,100],"strategy":[9],"for":[10,84,108],"k-clustering":[12,128],"minimum":[13,129],"completion":[14,130],"problem.":[15],"An":[16],"instance":[17],"of":[18,28,35,98,122],"problem":[20,37,56],"is":[21,38,49,57,65,117],"defined":[22],"in":[23,143],"a":[24,50,79,95,120],"complete":[25,51],"bipartite":[26,52],"graph":[27,43],"S":[29],"and":[30,103],"C":[31],"vertices.":[32],"The":[33,88,114],"goal":[34],"to":[39,69,126,138],"decompose":[40],"initial":[42],"into":[44],"k-clusters,":[45],"where":[46,132],"each":[47],"cluster":[48],"subgraph.":[53],"Since":[54],"NP":[58],"hard,":[59],"any":[60],"exact":[61],"solver,":[62],"like":[63],"Cplex,":[64],"often":[66],"not":[67],"sufficient":[68],"achieve":[70],"solutions":[71],"with":[72],"relatively":[73],"hight":[74],"quality.":[75],"Thus,":[76],"we":[77],"propose":[78],"first":[80],"alternative":[81],"solution":[82],"procedure":[83],"tackling":[85],"large-scale":[86],"instances.":[87],"designed":[89],"method":[90],"can":[91,105],"be":[92,106],"viewed":[93],"as":[94],"special":[96],"variant":[97],"search-based":[101],"it":[104],"applied":[107],"solving":[109],"several":[110],"complex":[111],"optimization":[112],"problems.":[113],"proposed":[115],"evaluated":[118],"on":[119],"set":[121],"benchmark":[123],"instances":[124],"related":[125],"problem,":[131],"its":[133],"achieved":[134],"results":[135,141],"are":[136],"compared":[137],"best":[140],"available":[142],"literature.":[145]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}