{"id":"https://openalex.org/W2925592697","doi":"https://doi.org/10.1051/ro/2019037","title":"A heuristic for the minimum cost chromatic partition problem","display_name":"A heuristic for the minimum cost chromatic partition problem","publication_year":2019,"publication_date":"2019-03-29","ids":{"openalex":"https://openalex.org/W2925592697","doi":"https://doi.org/10.1051/ro/2019037","mag":"2925592697"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2019037","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2019037","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2020/03/ro190018.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"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":true,"oa_status":"bronze","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/2020/03/ro190018.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032142322","display_name":"Celso C. Ribeiro","orcid":"https://orcid.org/0000-0002-9478-2351"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Celso C. Ribeiro","raw_affiliation_strings":["Institute of Computing, Universidade Federal Fluminense, Niter\u00f3i 24210-346, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Computing, Universidade Federal Fluminense, Niter\u00f3i 24210-346, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027472062","display_name":"Philippe L. F. dos Santos","orcid":"https://orcid.org/0000-0001-9777-7040"},"institutions":[{"id":"https://openalex.org/I3018965473","display_name":"Instituto Federal Fluminense","ror":"https://ror.org/0009eqg37","country_code":"BR","type":"education","lineage":["https://openalex.org/I3018965473"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Philippe L. F. dos Santos","raw_affiliation_strings":["Instituto Federal de Educa\u00e7\u00e3o, Ci\u00eancia e Tecnologia Fluminense, Campos dos Goytacazes 28030-130, Brazil"],"affiliations":[{"raw_affiliation_string":"Instituto Federal de Educa\u00e7\u00e3o, Ci\u00eancia e Tecnologia Fluminense, Campos dos Goytacazes 28030-130, Brazil","institution_ids":["https://openalex.org/I3018965473"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032142322"],"corresponding_institution_ids":["https://openalex.org/I161127581"],"apc_list":null,"apc_paid":null,"fwci":0.1981,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55245138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"54","issue":"3","first_page":"845","last_page":"871"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9922999739646912,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9828000068664551,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6279977560043335},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.567408561706543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5489868521690369},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5240583419799805},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5027968883514404},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.489243745803833},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.46432986855506897},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4498039782047272},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42465662956237793},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.4235362708568573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3877605199813843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38027632236480713},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31004732847213745},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2229723334312439},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11779800057411194}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6279977560043335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.567408561706543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5489868521690369},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5240583419799805},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5027968883514404},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.489243745803833},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.46432986855506897},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4498039782047272},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42465662956237793},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.4235362708568573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3877605199813843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38027632236480713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31004732847213745},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2229723334312439},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11779800057411194}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2019037","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2019037","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2020/03/ro190018.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"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:numdam.org:RO_2020__54_3_845_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2019037/","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":{"id":"doi:10.1051/ro/2019037","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2019037","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2020/03/ro190018.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2925592697.pdf","grobid_xml":"https://content.openalex.org/works/W2925592697.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W179940750","https://openalex.org/W1506751304","https://openalex.org/W1533433314","https://openalex.org/W1582334898","https://openalex.org/W1666015432","https://openalex.org/W1971493157","https://openalex.org/W1980672031","https://openalex.org/W2007033386","https://openalex.org/W2019683022","https://openalex.org/W2024110228","https://openalex.org/W2034368997","https://openalex.org/W2041526935","https://openalex.org/W2074887624","https://openalex.org/W2084318417","https://openalex.org/W2090980693","https://openalex.org/W2094629119","https://openalex.org/W2107306858","https://openalex.org/W2120470208","https://openalex.org/W2126927016","https://openalex.org/W2133826606","https://openalex.org/W2140411614","https://openalex.org/W2164824749","https://openalex.org/W2168000780","https://openalex.org/W2169235385","https://openalex.org/W2189595408","https://openalex.org/W2324827308","https://openalex.org/W2541616316","https://openalex.org/W2731478787","https://openalex.org/W2735006321","https://openalex.org/W3122168144"],"related_works":["https://openalex.org/W4291316360","https://openalex.org/W2793500002","https://openalex.org/W4297911588","https://openalex.org/W4311345810","https://openalex.org/W2585997002","https://openalex.org/W149461665","https://openalex.org/W3169197204","https://openalex.org/W2380525562","https://openalex.org/W4385455827","https://openalex.org/W2046652778"],"abstract_inverted_index":{"The":[0,30,73],"graph":[1,11,42],"coloring":[2,6,43,59],"problem":[3,35,44,74],"consists":[4],"in":[5,45,70,77,81],"the":[7,41,52,61,64,67],"vertices":[8,26],"of":[9,18,40,63,66],"a":[10,15,57,91],"G=(V,":[12],"E)":[13],"with":[14,51],"minimum":[16,31],"number":[17],"colors,":[19],"such":[20],"as":[21],"that":[22],"any":[23],"two":[24],"adjacent":[25],"receive":[27],"different":[28],"colors.":[29],"cost":[32],"chromatic":[33],"partition":[34],"(MCCPP)":[36],"is":[37],"an":[38],"extension":[39],"which":[46],"there":[47],"are":[48],"costs":[49,65],"associated":[50],"colors":[53,68],"and":[54,80,99,104],"one":[55],"seeks":[56],"vertex":[58],"minimizing":[60],"sum":[62],"used":[69],"each":[71],"vertex.":[72],"finds":[75],"applications":[76],"VLSI":[78],"design":[79],"some":[82],"scheduling":[83],"problems":[84],"modeled":[85],"on":[86],"interval":[87],"graphs.":[88],"We":[89],"propose":[90],"trajectory":[92],"search":[93],"heuristic":[94],"using":[95],"local":[96],"search,":[97],"path-relinking,":[98],"perturbations":[100],"for":[101],"solving":[102],"MCCPP":[103],"discuss":[105],"computational":[106],"results.":[107]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}