{"id":"https://openalex.org/W7151317432","doi":"https://doi.org/10.48550/arxiv.2604.03234","title":"Structural Segmentation of the Minimum Set Cover Problem: Exploiting Universe Decomposability for Metaheuristic Optimization","display_name":"Structural Segmentation of the Minimum Set Cover Problem: Exploiting Universe Decomposability for Metaheuristic Optimization","publication_year":2026,"publication_date":"2026-01-29","ids":{"openalex":"https://openalex.org/W7151317432","doi":"https://doi.org/10.48550/arxiv.2604.03234"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.03234","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.03234","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.03234","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042790169","display_name":"Isidora Rodr\u00edguez Hern\u00e1ndez","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hern\u00e1ndez, Isidora","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085478645","display_name":"H\u00e9ctor Ferrada","orcid":"https://orcid.org/0000-0002-8334-4540"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ferrada, H\u00e9ctor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088815725","display_name":"Crist\u00f3bal A. Navarro","orcid":"https://orcid.org/0000-0001-7090-9904"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Navarro, Crist\u00f3bal A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.3319999873638153,"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.3319999873638153,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1160999983549118,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.09809999912977219,"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.6466000080108643},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5455999970436096},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5454999804496765},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4699999988079071},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4496999979019165},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.44510000944137573},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.44020000100135803},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4194999933242798}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6466000080108643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5612000226974487},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5455999970436096},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48669999837875366},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4699999988079071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45350000262260437},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4496999979019165},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.44510000944137573},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44020000100135803},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4194999933242798},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.39750000834465027},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3521000146865845},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3343999981880188},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32850000262260437},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.3021000027656555},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2660999894142151},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26100000739097595},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.03234","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.03234","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.03234","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.03234","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Minimum":[1],"Set":[2],"Cover":[3],"Problem":[4],"(MSCP)":[5],"is":[6,110],"a":[7,21,158],"classical":[8],"NP-hard":[9],"combinatorial":[10],"optimization":[11],"problem":[12],"with":[13],"numerous":[14],"applications":[15],"in":[16,59],"science":[17],"and":[18,27,62,116,130,144,149],"engineering.":[19],"Although":[20],"wide":[22],"range":[23],"of":[24,46,56,101],"exact,":[25],"approximate,":[26],"metaheuristic":[28],"approaches":[29],"have":[30],"been":[31],"proposed,":[32],"most":[33],"methods":[34],"implicitly":[35],"treat":[36],"MSCP":[37,61],"instances":[38,129],"as":[39],"monolithic,":[40],"overlooking":[41],"potential":[42],"intrinsic":[43,65],"structural":[44,66],"properties":[45],"the":[47,54,60,99,102,113,169],"universe.":[48],"In":[49],"this":[50],"work,":[51],"we":[52],"investigate":[53],"concept":[55],"\\emph{universe":[57],"segmentability}":[58],"analyze":[63],"how":[64],"decomposition":[67,100],"(universe":[68],"segmentability)":[69],"can":[70],"be":[71],"exploited":[72],"to":[73,88],"enhance":[74],"heuristic":[75],"optimization.":[76],"We":[77],"propose":[78],"an":[79],"efficient":[80,165],"preprocessing":[81],"strategy":[82],"based":[83],"on":[84,126],"disjoint-set":[85],"union":[86],"(union--find)":[87],"detect":[89],"connected":[90],"components":[91],"induced":[92],"by":[93,157],"element":[94],"co-occurrence":[95],"within":[96],"subsets,":[97],"enabling":[98],"original":[103],"instance":[104],"into":[105],"independent":[106],"subproblems.":[107],"Each":[108],"subproblem":[109],"solved":[111],"using":[112],"GRASP":[114],"metaheuristic,":[115],"partial":[117],"solutions":[118],"are":[119,155],"combined":[120],"without":[121],"compromising":[122],"feasibility.":[123],"Extensive":[124],"experiments":[125],"standard":[127],"benchmark":[128],"large-scale":[131],"synthetic":[132],"datasets":[133],"show":[134],"that":[135,163],"exploiting":[136],"natural":[137],"universe":[138],"segmentation":[139],"consistently":[140],"improves":[141],"solution":[142],"quality":[143],"scalability,":[145],"particularly":[146],"for":[147],"large":[148],"structurally":[150],"decomposable":[151],"instances.":[152],"These":[153],"gains":[154],"supported":[156],"succinct":[159],"bit-level":[160],"set":[161,166],"representation":[162],"enables":[164],"operations,":[167],"making":[168],"proposed":[170],"approach":[171],"computationally":[172],"practical":[173],"at":[174],"scale.":[175]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-08T00:00:00"}