{"id":"https://openalex.org/W7108668432","doi":"https://doi.org/10.3390/a18120759","title":"Compact Models for Some Cluster Problems on Node-Colored Graphs","display_name":"Compact Models for Some Cluster Problems on Node-Colored Graphs","publication_year":2025,"publication_date":"2025-11-29","ids":{"openalex":"https://openalex.org/W7108668432","doi":"https://doi.org/10.3390/a18120759"},"language":"en","primary_location":{"id":"doi:10.3390/a18120759","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120759","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/a18120759","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Roberto Montemanni","orcid":"https://orcid.org/0000-0002-0229-0465"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Roberto Montemanni","raw_affiliation_strings":["Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, 42122 Reggio Emilia, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, 42122 Reggio Emilia, Italy","institution_ids":["https://openalex.org/I122346577"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Derek H. Smith","orcid":"https://orcid.org/0000-0002-8128-2067"},"institutions":[{"id":"https://openalex.org/I128993996","display_name":"University of South Wales","ror":"https://ror.org/02mzn7s88","country_code":"GB","type":"education","lineage":["https://openalex.org/I128993996"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Derek H. Smith","raw_affiliation_strings":["Faculty of Computing, Engineering and Science, University of South Wales, Pontypridd CF37 1DL, UK"],"affiliations":[{"raw_affiliation_string":"Faculty of Computing, Engineering and Science, University of South Wales, Pontypridd CF37 1DL, UK","institution_ids":["https://openalex.org/I128993996"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Pongchanun Luangpaiboon","orcid":"https://orcid.org/0000-0002-4155-0688"},"institutions":[{"id":"https://openalex.org/I108108428","display_name":"Thammasat University","ror":"https://ror.org/002yp7f20","country_code":"TH","type":"education","lineage":["https://openalex.org/I108108428"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Pongchanun Luangpaiboon","raw_affiliation_strings":["Faculty of Engineering, Thammasat School of Engineering, Thammasat University, Pathum Thani 12120, Thailand"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Thammasat School of Engineering, Thammasat University, Pathum Thani 12120, Thailand","institution_ids":["https://openalex.org/I108108428"]}]},{"author_position":"last","author":{"id":null,"display_name":"Pasura Aungkulanon","orcid":"https://orcid.org/0000-0002-7600-9752"},"institutions":[{"id":"https://openalex.org/I82828225","display_name":"King Mongkut's University of Technology North Bangkok","ror":"https://ror.org/04fy6jb97","country_code":"TH","type":"education","lineage":["https://openalex.org/I82828225"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Pasura Aungkulanon","raw_affiliation_strings":["Department of Materials Handling and Logistics Engineering, Faculty of Engineering, King Mongkut\u2019s University of Technology North Bangkok, Bangkok 10800, Thailand"],"affiliations":[{"raw_affiliation_string":"Department of Materials Handling and Logistics Engineering, Faculty of Engineering, King Mongkut\u2019s University of Technology North Bangkok, Bangkok 10800, Thailand","institution_ids":["https://openalex.org/I82828225"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122346577"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63742932,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"12","first_page":"759","last_page":"759"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.35910001397132874,"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.35910001397132874,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10429999977350235,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0746999979019165,"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/benchmark","display_name":"Benchmark (surveying)","score":0.4828999936580658},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46129998564720154},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4523000121116638},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44699999690055847},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4323999881744385},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3873000144958496},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.36469998955726624}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4828999936580658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47600001096725464},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46129998564720154},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4523000121116638},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44699999690055847},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4323999881744385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4302000105381012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4230000078678131},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3831999897956848},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32429999113082886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30820000171661377},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2743000090122223},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2526000142097473},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a18120759","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120759","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:3d185d14450641cfbfa2080be1f275d5","is_oa":true,"landing_page_url":"https://doaj.org/article/3d185d14450641cfbfa2080be1f275d5","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 18, Iss 12, p 759 (2025)","raw_type":"article"},{"id":"pmh:oai:iris.unimore.it:11380/1391368","is_oa":true,"landing_page_url":"https://hdl.handle.net/11380/1391368","pdf_url":null,"source":{"id":"https://openalex.org/S4377196326","display_name":"Iris Unimore (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.3390/a18120759","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120759","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.43115001916885376,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W788730291","https://openalex.org/W2041499697","https://openalex.org/W2055747219","https://openalex.org/W2126396654","https://openalex.org/W2130919252","https://openalex.org/W2135006981","https://openalex.org/W2136570298","https://openalex.org/W2150815458","https://openalex.org/W2490359642","https://openalex.org/W2811296076","https://openalex.org/W2951454425","https://openalex.org/W4313825608","https://openalex.org/W4390226701","https://openalex.org/W4400386286","https://openalex.org/W4405045345","https://openalex.org/W4411087748"],"related_works":[],"abstract_inverted_index":{"Three":[0],"optimization":[1],"problems":[2,16,72,171,211],"based":[3,103,134,149],"on":[4,104,135,150,164],"node-colored":[5],"undirected":[6],"graphs":[7],"are":[8,73,102,187,213],"the":[9,12,40,42,47,59,97,115,124,130,151,165,170,173,176,194,202,209,216],"subject":[10],"of":[11,39,58,96,114,141,154,175,201,208],"present":[13],"study.":[14],"These":[15,100,132],"model":[17],"real-world":[18],"applications":[19],"in":[20,56,66,129],"several":[21],"domains,":[22],"such":[23],"as":[24],"cybersecurity,":[25],"bioinformatics,":[26],"and":[27],"social":[28],"networks,":[29],"although":[30],"they":[31],"have":[32],"a":[33,62,87,157,205],"similar":[34],"abstract":[35],"representation.":[36],"In":[37],"all":[38],"problems,":[41],"goal":[43],"is":[44,119],"to":[45,76,81,121,189],"partition":[46],"graph":[48],"into":[49,183],"colorful":[50],"connected":[51,60],"components,":[52,61],"which":[53],"means":[54],"that":[55,126],"each":[57,95],"color":[63],"can":[64],"appear":[65],"at":[67],"most":[68],"one":[69],"node.":[70],"The":[71,111],"optimized":[74],"according":[75],"different":[77,82,210],"objective":[78],"functions,":[79],"leading":[80],"optimal":[83],"partitions.":[84],"We":[85],"propose":[86],"compact":[88,112,178],"Mixed":[89],"Integer":[90],"Linear":[91],"Programming":[92],"formulation":[93],"for":[94,169,215],"three":[98],"problems.":[99],"models":[101,118,136],"spanning":[105],"trees,":[106],"represented":[107],"through":[108],"multi-commodity":[109],"flows.":[110],"nature":[113],"new":[116,177],"linear":[117],"easier":[120],"handle":[122],"than":[123,193],"approaches":[125],"previously":[127],"appeared":[128],"literature.":[131],"were":[133],"with":[137],"an":[138,199],"exponential":[139],"number":[140],"constraints,":[142],"which,":[143,180],"therefore,":[144],"required":[145],"complex":[146],"solving":[147],"techniques":[148],"dynamic":[152],"generation":[153],"constraints":[155],"within":[156],"branch-and-cut":[158],"framework.":[159],"Computational":[160],"experiments":[161],"carried":[162],"out":[163],"standard":[166],"benchmark":[167],"instances":[168,207],"show":[172],"potential":[174],"methods,":[179],"once":[181],"fed":[182],"modern":[184],"state-of-the-art":[185],"solvers,":[186],"able":[188],"obtain":[190],"results":[191],"better":[192],"previous":[195],"algorithmic":[196],"approaches.":[197],"As":[198],"outcome":[200],"experimental":[203],"campaign,":[204],"dozen":[206],"considered":[212],"closed":[214],"first":[217],"time.":[218]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-12-05T00:00:00"}