{"id":"https://openalex.org/W2811469961","doi":"https://doi.org/10.1109/codit.2018.8394892","title":"An Iterated Local Search ILS-CHC for the Maximum Vertex-Weighted Clique Problem","display_name":"An Iterated Local Search ILS-CHC for the Maximum Vertex-Weighted Clique Problem","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2811469961","doi":"https://doi.org/10.1109/codit.2018.8394892","mag":"2811469961"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2018.8394892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th 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/A5048710169","display_name":"Dalila Tayachi","orcid":null},"institutions":[{"id":"https://openalex.org/I83259278","display_name":"Manouba University","ror":"https://ror.org/0503ejf32","country_code":"TN","type":"education","lineage":["https://openalex.org/I83259278"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"D. Tayachi","raw_affiliation_strings":["Ecole Sup\u00e9rieure de Commerce de Tunis (ESCT), Univ. Manouba, Manouba, Tunisia"],"affiliations":[{"raw_affiliation_string":"Ecole Sup\u00e9rieure de Commerce de Tunis (ESCT), Univ. Manouba, Manouba, Tunisia","institution_ids":["https://openalex.org/I83259278"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041469134","display_name":"N. Zaddem","orcid":null},"institutions":[{"id":"https://openalex.org/I83259278","display_name":"Manouba University","ror":"https://ror.org/0503ejf32","country_code":"TN","type":"education","lineage":["https://openalex.org/I83259278"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"N. Zaddem","raw_affiliation_strings":["Ecole Sup\u00e9rieure de Commerce de Tunis (ESCT), Univ. Manouba, Manouba, Tunisia"],"affiliations":[{"raw_affiliation_string":"Ecole Sup\u00e9rieure de Commerce de Tunis (ESCT), Univ. Manouba, Manouba, Tunisia","institution_ids":["https://openalex.org/I83259278"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048710169"],"corresponding_institution_ids":["https://openalex.org/I83259278"],"apc_list":null,"apc_paid":null,"fwci":0.4039,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63239975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"555","last_page":"562"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/clique-problem","display_name":"Clique problem","score":0.8469793796539307},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6626158952713013},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6220114231109619},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5847257971763611},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.546665608882904},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5282401442527771},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5205156207084656},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5104860067367554},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4912709593772888},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4637466371059418},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.45991837978363037},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4336886703968048},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.42715027928352356},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4257677495479584},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4087180495262146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4086507558822632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33990639448165894},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1192784309387207},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.09145230054855347}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.8469793796539307},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6626158952713013},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6220114231109619},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5847257971763611},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.546665608882904},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5282401442527771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5205156207084656},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5104860067367554},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4912709593772888},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4637466371059418},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.45991837978363037},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4336886703968048},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.42715027928352356},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4257677495479584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4087180495262146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4086507558822632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33990639448165894},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1192784309387207},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.09145230054855347},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2018.8394892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W95841981","https://openalex.org/W1605165687","https://openalex.org/W1972760347","https://openalex.org/W2078758659","https://openalex.org/W2094314299","https://openalex.org/W2094836579","https://openalex.org/W2119332979"],"related_works":["https://openalex.org/W1557730243","https://openalex.org/W2079699445","https://openalex.org/W2810770079","https://openalex.org/W2388432652","https://openalex.org/W1516636018","https://openalex.org/W2378179553","https://openalex.org/W2811469961","https://openalex.org/W1882421805","https://openalex.org/W1520195889","https://openalex.org/W2929047994"],"abstract_inverted_index":{"In":[0],"this":[1,51],"paper,":[2],"we":[3,64],"tackle":[4],"the":[5,25,74,92,98,104,121],"Maximum":[6],"Vertex-Weighted":[7],"Clique":[8],"Problem":[9],"MVWCP.":[10],"This":[11],"problem":[12,43],"consists":[13],"to":[14,54,113],"find":[15,114],"in":[16,59,120,123],"any":[17],"weighted":[18],"and":[19,83,107],"non-oriented":[20],"graph":[21],"a":[22,29,34,78],"clique":[23],"with":[24,44,103],"maximum":[26,35],"weight,":[27],"i.e.":[28],"complete":[30],"subgraph":[31],"which":[32,72],"has":[33],"weight.":[36],"MVWCP":[37],"is":[38,53,110],"an":[39,66],"NP-hard":[40],"combinatorial":[41],"optimization":[42],"many":[45,124],"practical":[46],"applications.":[47],"The":[48],"objective":[49],"of":[50,86],"work":[52],"provide":[55],"good":[56],"quality":[57],"solutions":[58],"reasonable":[60],"computational":[61],"times.":[62],"Thus,":[63],"propose":[65],"iterated":[67],"local":[68,80],"search":[69,75,81],"method":[70,82],"ILS-CHC":[71],"explores":[73],"space":[76],"using":[77],"combined":[79],"two":[84],"levels":[85],"perturbation.":[87],"Experimental":[88],"studies":[89],"conducted":[90],"on":[91],"DIMACS":[93],"benchmark":[94],"instances":[95],"show":[96],"that":[97,108],"proposed":[99],"approach":[100],"compares":[101],"favorably":[102],"state-of-the-art":[105],"methods":[106],"it":[109],"even":[111],"able":[112],"better":[115],"cliques":[116],"than":[117],"those":[118],"found":[119],"literature":[122],"instances.":[125]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}