{"id":"https://openalex.org/W2533881842","doi":"https://doi.org/10.1109/codit.2016.7593637","title":"Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem","display_name":"Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2533881842","doi":"https://doi.org/10.1109/codit.2016.7593637","mag":"2533881842"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2016.7593637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/A5022868166","display_name":"Najat Hameed Qasim Al-Iedani","orcid":"https://orcid.org/0000-0001-8456-4070"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Najat Al-Iedani","raw_affiliation_strings":["Universit\u00e9 de Picardie Jules Verne EPROAD- EA, Amiens, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Picardie Jules Verne EPROAD- EA, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044647341","display_name":"Mhand Hifi","orcid":"https://orcid.org/0000-0002-1031-7701"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mhand Hifi","raw_affiliation_strings":["Universit\u00e9 de Picardie Jules Verne EPROAD- EA, Amiens, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Picardie Jules Verne EPROAD- EA, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050013740","display_name":"Toufik Saadi","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Toufik Saadi","raw_affiliation_strings":["Universit\u00e9 de Picardie Jules Verne EPROAD- EA, Amiens, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Picardie Jules Verne EPROAD- EA, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022868166"],"corresponding_institution_ids":["https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.14891436,"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":"639","last_page":"643"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9891999959945679,"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.6082875728607178},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5944399833679199},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5160233974456787},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5038871169090271},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.41951417922973633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4034741520881653},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.361561119556427},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.312688410282135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29578065872192383},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.2702144384384155},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09730887413024902}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6082875728607178},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5944399833679199},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5160233974456787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5038871169090271},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.41951417922973633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4034741520881653},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.361561119556427},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.312688410282135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29578065872192383},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2702144384384155},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09730887413024902}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit.2016.7593637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03617905v1","is_oa":false,"landing_page_url":"https://u-picardie.hal.science/hal-03617905","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":"2016 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), Apr 2016, Saint Pauls Bay, Malta. pp.639-643","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1146855678","https://openalex.org/W1554727768","https://openalex.org/W1589307603","https://openalex.org/W2003331610","https://openalex.org/W2024085737","https://openalex.org/W6712794079"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W3125283862","https://openalex.org/W2594278890","https://openalex.org/W103329119","https://openalex.org/W1941981067","https://openalex.org/W1490843286","https://openalex.org/W2142109806","https://openalex.org/W2950502967","https://openalex.org/W2466096890","https://openalex.org/W2307306733"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,56],"propose":[4],"the":[5,11,31,58,99,141,152,163,166,173,176],"neighborhood":[6,164],"search-based":[7],"heuristic":[8],"to":[9,105],"solve":[10],"k-clustering":[12,117],"minimum":[13,118],"biclique":[14,44,119],"completion":[15,120],"problem.":[16],"The":[17,130,169],"KCmBCP":[18],"consists":[19],"in":[20,75,86,89],"partitioning":[21],"a":[22,43,48,158],"bipartite":[23,49,63],"undirected":[24],"graph":[25,50],"into":[26,42],"k":[27,62],"clusters":[28],"such":[29,67],"that":[30,36,68],"total":[32,100],"number":[33,101],"of":[34,60,72,78,83,94,102,136,151,157,165,175],"edges":[35,103],"added":[37],"for":[38],"complete":[39,109],"each":[40,69,87,107],"cluster":[41,88,108],"is":[45,110,114],"minimum.":[46],"Given":[47],"G":[51],"=":[52],"(S,":[53],"T,":[54],"E),":[55],"consider":[57],"problem":[59,113,121],"finding":[61],"sub-graphs,":[64],"called":[65],"clusters,":[66],"vertex":[70,81],"i":[71],"S":[73],"appears":[74,85],"exactly":[76],"one":[77,93],"them,":[79],"every":[80],"j":[82],"T":[84],"which":[90,148],"at":[91],"least":[92],"its":[95],"neighbors":[96],"appears,":[97],"and":[98,124,155],"needed":[104],"make":[106],"minimized.":[111],"This":[112],"known":[115],"as":[116],"(noted":[122],"KCmBCP)":[123],"has":[125],"been":[126],"shown":[127],"strongly":[128],"NP-hard.":[129],"proposed":[131,142,177],"approach":[132,143],"begins":[133],"by":[134,161],"construction":[135],"an":[137],"initial":[138,153],"solution.":[139,168],"After,":[140],"enters":[144],"on":[145],"iterative":[146],"phase,":[147],"destroys":[149],"part":[150],"solution":[154,160],"build":[156],"feasible":[159],"exploring":[162],"current":[167],"experimental":[170],"results":[171],"show":[172],"effectiveness":[174],"approach.":[178]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}