{"id":"https://openalex.org/W7138968313","doi":"https://doi.org/10.48550/arxiv.2603.16593","title":"Scalable Inspection Planning via Flow-based Mixed Integer Linear Programming","display_name":"Scalable Inspection Planning via Flow-based Mixed Integer Linear Programming","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7138968313","doi":"https://doi.org/10.48550/arxiv.2603.16593"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.16593","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16593","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.16593","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047484782","display_name":"Adir Morgan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morgan, Adir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000480439","display_name":"Kiril Solovey","orcid":"https://orcid.org/0000-0003-0254-0572"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Solovey, Kiril","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078885681","display_name":"Oren Salzman","orcid":"https://orcid.org/0000-0003-4541-8219"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Salzman, Oren","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.14569999277591705,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.14569999277591705,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.09640000015497208,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.056699998676776886,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/solver","display_name":"Solver","score":0.7853000164031982},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7017999887466431},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6973999738693237},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6412000060081482},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5206999778747559},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.49939998984336853},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47099998593330383},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.43290001153945923},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4196000099182129}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7853000164031982},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7017999887466431},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6973999738693237},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6836000084877014},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6412000060081482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5800999999046326},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5206999778747559},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.49939998984336853},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.43290001153945923},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.38179999589920044},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3797000050544739},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3792000114917755},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3646000027656555},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.33719998598098755},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32120001316070557},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3066999912261963},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.30090001225471497},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27549999952316284},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.262800008058548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.16593","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16593","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"doi:10.48550/arxiv.2603.16593","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16593","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6337420344352722,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Inspection":[0],"planning":[1,57],"is":[2,122],"concerned":[3],"with":[4,197],"computing":[5],"the":[6,21,40,111,126,146],"shortest":[7],"robot":[8],"path":[9],"to":[10,35,49,66,81,199,215],"inspect":[11],"a":[12,28,51,82,123,131,140],"given":[13],"set":[14],"of":[15,17,31,125,149,204],"points":[16],"interest":[18],"(POIs)":[19],"using":[20],"robot's":[22],"sensors.":[23],"This":[24],"problem":[25],"arises":[26],"in":[27,90,113],"wide":[29],"range":[30],"applications":[32],"from":[33],"manufacturing":[34],"medical":[36,156],"robotics.":[37],"To":[38],"alleviate":[39],"problem's":[41,127],"complexity,":[42],"recent":[43],"methods":[44,48,209],"rely":[45],"on":[46,155,182],"sampling-based":[47],"obtain":[50],"more":[52],"manageable":[53],"(discrete)":[54],"graph":[55],"inspection":[56],"(GIP)":[58],"problem.":[59],"Unfortunately,":[60],"GIP":[61,107],"still":[62],"remains":[63],"highly":[64,98],"difficult":[65],"solve":[67],"at":[68,87],"scale":[69],"as":[70,130],"it":[71,191],"requires":[72],"simultaneously":[73],"satisfying":[74],"POI-coverage":[75],"and":[76,116,139,157,202],"path-connectivity":[77],"constraints,":[78],"giving":[79],"rise":[80],"challenging":[83],"optimization":[84],"problem,":[85],"particularly":[86],"scales":[88],"encountered":[89],"real-world":[91],"scenarios.":[92],"In":[93],"this":[94],"work,":[95],"we":[96],"present":[97],"scalable":[99],"Mixed":[100],"Integer":[101],"Linear":[102],"Programming":[103],"(MILP)":[104],"solutions":[105,194],"for":[106,195],"that":[108,144],"significantly":[109],"advance":[110],"state-of-the-art":[112,208],"both":[114],"runtime":[115],"solution":[117],"quality.":[118],"Our":[119],"key":[120],"insight":[121],"reformulation":[124],"core":[128],"constraints":[129],"network":[132],"flow,":[133],"which":[134],"enables":[135],"effective":[136],"MILP":[137],"models":[138],"specialized":[141],"Branch-and-Cut":[142],"solver":[143,187],"exploits":[145],"combinatorial":[147],"structure":[148],"flows.":[150],"We":[151],"evaluate":[152],"our":[153,167,186],"approach":[154],"infrastructure":[158],"benchmarks":[159],"alongside":[160],"large-scale":[161],"synthetic":[162],"instances.":[163,184],"Across":[164],"all":[165],"scenarios,":[166],"method":[168],"produces":[169],"substantially":[170],"tighter":[171],"lower":[172],"bounds":[173],"than":[174],"existing":[175],"formulations,":[176],"reducing":[177],"optimality":[178,219],"gaps":[179],"by":[180],"30-50%":[181],"large":[183],"Furthermore,":[185],"demonstrates":[188],"unprecedented":[189],"scalability:":[190],"provides":[192],"non-trivial":[193],"problems":[196],"up":[198],"15,000":[200],"vertices":[201],"thousands":[203],"POIs,":[205],"where":[206],"prior":[207],"typically":[210],"exhaust":[211],"memory":[212],"or":[213],"fail":[214],"provide":[216],"any":[217],"meaningful":[218],"guarantees.":[220]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-20T00:00:00"}