{"id":"https://openalex.org/W7131226165","doi":"https://doi.org/10.48550/arxiv.2602.18438","title":"Exact Algorithms for Resource Reallocation Under Budgetary Constraints","display_name":"Exact Algorithms for Resource Reallocation Under Budgetary Constraints","publication_year":2025,"publication_date":"2025-11-22","ids":{"openalex":"https://openalex.org/W7131226165","doi":"https://doi.org/10.48550/arxiv.2602.18438"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.18438","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126661156","display_name":"Arun Kumar Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Arun Kumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126723565","display_name":"Sandip Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Sandip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126690434","display_name":"Sweta Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Sweta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018558873","display_name":"Foivos Fioravantes","orcid":"https://orcid.org/0000-0001-8217-030X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fioravantes, Foivos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088003340","display_name":"Nikolaos Melissinos","orcid":"https://orcid.org/0000-0002-0864-9803"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Melissinos, Nikolaos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.3402999937534332,"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.3402999937534332,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.1395999938249588,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.1251000016927719,"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/bounded-function","display_name":"Bounded function","score":0.5698999762535095},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5315999984741211},{"id":"https://openalex.org/keywords/productivity","display_name":"Productivity","score":0.45719999074935913},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.44429999589920044},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.41130000352859497},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.39910000562667847},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.3968999981880188},{"id":"https://openalex.org/keywords/service-provider","display_name":"Service provider","score":0.3953999876976013}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6179999709129333},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5698999762535095},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5315999984741211},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48840001225471497},{"id":"https://openalex.org/C204983608","wikidata":"https://www.wikidata.org/wiki/Q2111958","display_name":"Productivity","level":2,"score":0.45719999074935913},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.44429999589920044},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.41130000352859497},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C116537","wikidata":"https://www.wikidata.org/wiki/Q2169973","display_name":"Service provider","level":3,"score":0.3953999876976013},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33500000834465027},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C181889124","wikidata":"https://www.wikidata.org/wiki/Q380204","display_name":"Service level","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.29739999771118164},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C29321873","wikidata":"https://www.wikidata.org/wiki/Q5970087","display_name":"Economies of scale","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C66204764","wikidata":"https://www.wikidata.org/wiki/Q219416","display_name":"Sustainability","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.18438","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Article"},{"id":"doi:10.48550/arxiv.2602.18438","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18438","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.18438","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Efficient":[0],"resource":[1],"(re-)allocation":[2],"is":[3,102],"a":[4,27,48,53,99],"critical":[5],"challenge":[6],"in":[7,73],"optimizing":[8],"productivity":[9],"and":[10],"sustainability":[11],"within":[12],"multi-party":[13],"supply":[14],"networks.":[15],"In":[16],"this":[17],"work,":[18],"we":[19],"introduce":[20],"the":[21,39,65],"\\textsc{Red-Blue":[22],"Reinforcement}":[23],"(R-BR)":[24],"problem,":[25],"where":[26],"service":[28],"provider":[29],"under":[30],"budgetary":[31],"constraints":[32],"must":[33],"minimize":[34],"client":[35],"reallocations":[36],"to":[37,88],"reduce":[38],"required":[40],"number":[41],"of":[42,103],"servers":[43],"they":[44],"should":[45],"maintain":[46],"by":[47],"specified":[49],"amount.":[50],"We":[51],"conduct":[52],"systematic":[54],"algorithmic":[55],"study,":[56],"providing":[57],"three":[58],"exact":[59],"algorithms":[60,76],"that":[61,81,101],"scale":[62],"well":[63],"as":[64],"input":[66],"grows":[67],"(FPT),":[68],"which":[69],"could":[70],"prove":[71],"useful":[72],"practice.":[74],"Our":[75],"are":[77],"efficient":[78],"for":[79],"topologies":[80],"model":[82],"rural":[83],"road":[84],"networks":[85],"(bounded":[86,93],"distance":[87],"cluster),":[89],"modern":[90],"transportation":[91],"systems":[92],"modular-width),":[94],"or":[95],"have":[96],"bounded":[97],"clique-width,":[98],"parameter":[100],"great":[104],"theoretical":[105],"importance.":[106]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-02-25T00:00:00"}