{"id":"https://openalex.org/W7156583435","doi":"https://doi.org/10.48550/arxiv.2604.23480","title":"Resource-Constrained Shortest Path with Polytopic Reset Sets","display_name":"Resource-Constrained Shortest Path with Polytopic Reset Sets","publication_year":2026,"publication_date":"2026-04-26","ids":{"openalex":"https://openalex.org/W7156583435","doi":"https://doi.org/10.48550/arxiv.2604.23480"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.23480","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23480","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.23480","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134776652","display_name":"Khaled Surur","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Surur, Khaled","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134751771","display_name":"Melkior Ornik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ornik, Melkior","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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.6539000272750854,"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.6539000272750854,"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.08900000154972076,"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.06800000369548798,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.739300012588501},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6258999705314636},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5464000105857849},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.45660001039505005},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4311999976634979},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43050000071525574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4068000018596649},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.39559999108314514},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.38600000739097595}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.739300012588501},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6258999705314636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6011000275611877},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5464000105857849},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5443000197410583},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.45660001039505005},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43050000071525574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.39559999108314514},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.38600000739097595},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.385699987411499},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3716000020503998},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.3580999970436096},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3513000011444092},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.33799999952316284},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3361999988555908},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.32749998569488525},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.28209999203681946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2791999876499176},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25870001316070557}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.23480","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23480","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.23480","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23480","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":{"This":[0,185],"paper":[1],"investigates":[2],"the":[3,7,22,25,43,76,104,107,139,142,150,169,180,183,192],"problem":[4,48,78,145],"of":[5,24,56,100,118,141,153,165,182],"computing":[6],"shortest":[8,143,194],"path":[9,26,45,144,195],"between":[10,110,137],"two":[11,80],"states":[12],"under":[13],"resource":[14],"constraints":[15],"in":[16,46,79],"environments":[17],"with":[18,196],"resource-replenishment":[19],"regions.":[20,39],"Namely,":[21],"length":[23],"is":[27,176],"limited":[28],"by":[29,87],"a":[30,50,83,93,115,122,129,133,188],"budget":[31,197],"that":[32,42,120],"can":[33],"be":[34],"restored":[35],"within":[36],"polytopic":[37],"replenishment":[38,62],"We":[40,70],"show":[41],"optimal":[44,151,171],"this":[47,147,163],"exhibits":[49],"distinct":[51],"geometric":[52],"structure:":[53],"it":[54],"consists":[55],"straight-line":[57],"segments,":[58],"changes":[59],"direction":[60],"at":[61,67],"regions,":[63],"and":[64,103,124],"visits":[65],"regions":[66],"most":[68],"once.":[69],"propose":[71],"an":[72],"approach":[73,186],"to":[74,155,167,178],"solve":[75],"continuous":[77],"steps:":[81],"using":[82],"graph-based":[84],"approach,":[85],"followed":[86],"convex":[88,160],"programming.":[89],"First,":[90],"we":[91,127,158],"define":[92],"graph":[94,148],"whose":[95],"nodes":[96,119],"are":[97,106],"possible":[98],"waypoints":[99],"feasible":[101,123],"paths,":[102],"edges":[105],"Euclidean":[108],"distances":[109],"these":[111],"nodes.":[112],"To":[113],"obtain":[114],"discrete":[116],"set":[117],"ensure":[121],"near-optimal":[125],"solution,":[126],"utilize":[128],"wavefront":[130],"algorithm.":[131],"With":[132],"sufficiently":[134],"small":[135],"spacing":[136],"wavefronts,":[138],"solution":[140],"on":[146,162],"yields":[149],"sequence":[152,164],"polytopes":[154,166],"visit.":[156],"Next,":[157],"use":[159],"optimization":[161],"find":[168],"exact":[170],"path.":[172],"A":[173],"numerical":[174],"experiment":[175],"presented":[177],"demonstrate":[179],"effectiveness":[181],"approach.":[184],"provides":[187],"framework":[189],"for":[190],"solving":[191],"resource-constrained":[193],"reset.":[198]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-29T00:00:00"}