{"id":"https://openalex.org/W2810523637","doi":"https://doi.org/10.1051/ro/2018048","title":"Application of the \u201cdescent with mutations\u201d metaheuristic to a clique partitioning problem","display_name":"Application of the \u201cdescent with mutations\u201d metaheuristic to a clique partitioning problem","publication_year":2018,"publication_date":"2018-06-25","ids":{"openalex":"https://openalex.org/W2810523637","doi":"https://doi.org/10.1051/ro/2018048","mag":"2810523637"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2018048","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2018048","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-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/A5003502766","display_name":"Olivier Hudry","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Olivier Hudry","raw_affiliation_strings":["Telecom ParisTech, 46, rue Barrault, 75634 Paris Cedex 13, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telecom ParisTech, 46, rue Barrault, 75634 Paris Cedex 13, France","institution_ids":["https://openalex.org/I12356871"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003502766"],"corresponding_institution_ids":["https://openalex.org/I12356871"],"apc_list":null,"apc_paid":null,"fwci":0.1637,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57975582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"53","issue":"3","first_page":"1083","last_page":"1095"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.984499990940094,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9699000120162964,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/metaheuristic","display_name":"Metaheuristic","score":0.770244836807251},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7587231397628784},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6016541123390198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5871173143386841},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.580015242099762},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5589202642440796},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.48745039105415344},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.44898679852485657},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4433290362358093},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4101915955543518},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37454134225845337},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.08055749535560608}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.770244836807251},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7587231397628784},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6016541123390198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5871173143386841},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.580015242099762},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5589202642440796},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.48745039105415344},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.44898679852485657},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4433290362358093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4101915955543518},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37454134225845337},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.08055749535560608},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2018048","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2018048","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02264943v1","is_oa":false,"landing_page_url":"https://telecom-paris.hal.science/hal-02264943","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":"RAIRO - Operations Research, 2019, 53 (3), pp.1083-1095","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:numdam.org:RO_2019__53_3_1083_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2018048/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5323198165","display_name":"Computation, Communication, Rationality and Incentives in Collective and Cooperative Decision Making","funder_award_id":"ANR-14-CE24-0007","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W10361471","https://openalex.org/W18428236","https://openalex.org/W117079032","https://openalex.org/W178407265","https://openalex.org/W188269987","https://openalex.org/W1613273921","https://openalex.org/W2021377420","https://openalex.org/W2049241046","https://openalex.org/W2055764977","https://openalex.org/W2065124960","https://openalex.org/W2088490660","https://openalex.org/W2088508248","https://openalex.org/W2122451634","https://openalex.org/W2169275881","https://openalex.org/W2475591633","https://openalex.org/W2479531384","https://openalex.org/W4232338975","https://openalex.org/W4246565613","https://openalex.org/W4298236029"],"related_works":["https://openalex.org/W1939200287","https://openalex.org/W2082305040","https://openalex.org/W4381955380","https://openalex.org/W1980833393","https://openalex.org/W2169954640","https://openalex.org/W1967228184","https://openalex.org/W2946244341","https://openalex.org/W2794565019","https://openalex.org/W2264356384","https://openalex.org/W2952246343"],"abstract_inverted_index":{"We":[0,153],"study":[1],"here":[2],"the":[3,6,16,27,57,72,77,93,96,99,124,150,169,176,182,192],"application":[4],"of":[5,18,29,41,59,79,95,98,122,171],"\u201cdescent":[7,114],"with":[8,26,50,101,115,147,156,184],"mutations\u201d":[9,116],"metaheuristic":[10],"to":[11,70,75,91,149,209,212],"a":[12,38,42,51,106,118,163,201],"problem":[13,110,194],"arising":[14],"from":[15,175],"field":[17],"classification":[19],"and":[20,32,129,211],"cluster":[21],"analysis":[22],"(dealing":[23],"more":[24],"precisely":[25],"aggregation":[28],"symmetric":[30],"relations)":[31],"which":[33,63,123,161],"can":[34,64],"be":[35,65],"represented":[36],"as":[37,189,195],"clique":[39],"partitioning":[40],"weighted":[43],"graph.":[44],"In":[45],"this":[46,109,196],"problem,":[47],"we":[48],"deai":[49],"complete":[52],"undirected":[53],"graphe":[54],"G":[55,60,80,88],";":[56],"edges":[58,100],"have":[61],"weights":[62,97],"positive,":[66],"negative":[67],"or":[68,145],"equal":[69],"0;":[71],"aim":[73],"is":[74,111,117,126,130,162,186,206],"partition":[76],"vertices":[78],"into":[81],"disjoint":[82],"cliques":[83],"(whose":[84],"number":[85],"depends":[86],"on":[87,132],"in":[89,105,137],"order":[90],"minimize":[92],"sum":[94],"their":[102],"two":[103],"extremities":[104],"same":[107],"clique;":[108],"NP-hard.":[112],"The":[113],"local":[119,133],"search":[120],"metaheuristic,":[121,160],"design":[125,210],"very":[127,158],"simple":[128],"based":[131],"transformation.":[134],"It":[135],"consists":[136],"randomly":[138],"performing":[139],"random":[140],"elementary":[141],"transformations,":[142],"irrespective":[143],"improvement":[144],"worsening":[146],"respect":[148],"objective":[151],"function.":[152],"compare":[154],"it":[155,205],"another":[157],"efficient":[159,190],"simulated":[164,198],"annealing":[165],"method":[166],"improved":[167,197],"by":[168],"addition":[170],"some":[172],"ingredients":[173],"coming":[174],"noising":[177],"methods.":[178],"Experiments":[179],"show":[180],"that":[181],"descent":[183],"mutations":[185],"at":[187],"least":[188],"for":[191],"studied":[193],"annealing,":[199],"usually":[200],"little":[202],"better,":[203],"while":[204],"much":[207],"easier":[208],"tune.":[213]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-07T06:14:10.401900","created_date":"2025-10-10T00:00:00"}