{"id":"https://openalex.org/W7164853409","doi":"https://doi.org/10.48550/arxiv.2606.14611","title":"Robust Network Flow Interdiction Problems with Applications to Counter-Narcotics","display_name":"Robust Network Flow Interdiction Problems with Applications to Counter-Narcotics","publication_year":2026,"publication_date":"2026-06-12","ids":{"openalex":"https://openalex.org/W7164853409","doi":"https://doi.org/10.48550/arxiv.2606.14611"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.14611","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14611","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":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.2606.14611","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134840836","display_name":"Diksha Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Diksha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134874444","display_name":"Madhav Marathe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marathe, Madhav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134821583","display_name":"Anil Vullikanti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vullikanti, Anil","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/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9520999789237976,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9520999789237976,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10734","display_name":"Information and Cyber Security","score":0.006200000178068876,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11864","display_name":"Supply Chain Resilience and Risk Management","score":0.004699999932199717,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.9912999868392944},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.657800018787384},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5146999955177307},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.49720001220703125},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.4871000051498413},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.3668000102043152},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.35359999537467957},{"id":"https://openalex.org/keywords/network-model","display_name":"Network model","score":0.3253999948501587}],"concepts":[{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.9912999868392944},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.657800018787384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6352999806404114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.59170001745224},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5146999955177307},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49720001220703125},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.3668000102043152},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.35359999537467957},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3118000030517578},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.28839999437332153},{"id":"https://openalex.org/C2988224531","wikidata":"https://www.wikidata.org/wiki/Q20830730","display_name":"Network structure","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C203274722","wikidata":"https://www.wikidata.org/wiki/Q7001161","display_name":"Network performance","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2563999891281128},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.14611","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14611","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":"doi:10.48550/arxiv.2606.14611","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14611","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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Interdiction":[0],"problems":[1,118],"arise":[2],"in":[3,41,65,255],"a":[4,42,124,241],"number":[5],"of":[6,25,32,54,80,90,103,114,132],"application":[7],"areas,":[8],"including":[9],"global":[10],"security,":[11],"supply":[12],"chains,":[13],"and":[14,83,87,168,184,247],"critical":[15],"infrastructure":[16],"protection":[17],"-":[18],"the":[19,23,52,60,77,81,112,156,162,176,180,186,190,212,220,250],"goal":[20],"is":[21,35,69,105],"inhibit":[22],"movement":[24],"goods,":[26],"people":[27],"or":[28,39,48],"information.":[29],"An":[30],"area":[31],"particular":[33],"interest":[34],"counter-narcotics,":[36],"where":[37],"nodes":[38],"edges":[40],"network":[43,115,120,134,150,164],"are":[44,74,153],"placed":[45],"under":[46,119,234],"surveillance":[47],"blocked":[49],"to":[50,59,148,174],"minimize":[51],"flow":[53,116,165,202],"illicit":[55],"drugs":[56],"from":[57],"source":[58],"destination.":[61],"A":[62],"fundamental":[63],"challenge":[64],"this":[66,100,108],"narco-traffic":[67],"interdiction":[68,96,117,166,182,253],"data":[70],"scarcity:":[71],"available":[72],"datasets":[73],"limited":[75,125],"by":[76],"very":[78],"nature":[79],"problem":[82,167],"provide":[84],"only":[85],"partial":[86],"uncertain":[88],"views":[89],"trafficking":[91,138],"networks.":[92],"Thus,":[93],"developing":[94],"robust":[95,163,215,221],"methods":[97],"that":[98,152,195,219],"take":[99],"inherent":[101],"lack":[102],"information":[104],"critical.":[106],"In":[107],"paper":[109],"we":[110,128,160],"initiate":[111],"study":[113],"uncertainty.":[121,236],"First,":[122],"using":[123],"real-world":[126],"dataset,":[127],"generate":[129,149],"an":[130,170],"ensemble":[131],"plausible":[133],"realizations":[135,230],"representing":[136],"alternative":[137],"scenarios.":[139,191],"The":[140],"method":[141],"combines":[142],"simulations":[143],"with":[144,155],"mathematical":[145],"programming":[146],"techniques":[147],"ensembles":[151],"consistent":[154],"observed":[157],"data.":[158],"Second,":[159],"formulate":[161],"develop":[169],"integer":[171],"linear":[172],"program":[173],"solve":[175],"problem.":[177],"We":[178,217],"evaluate":[179],"optimal":[181,205],"strategy":[183,222],"obtain":[185],"residual":[187],"flows":[188],"over":[189],"Our":[192],"analysis":[193,246],"reveals":[194],"even":[196],"modest":[197],"budgets":[198],"can":[199],"yield":[200],"significant":[201],"reductions.":[203],"However,":[204],"solutions":[206],"vary":[207],"substantially":[208],"across":[209,226],"scenarios,":[210],"motivating":[211],"need":[213],"for":[214,244],"solutions.":[216],"show":[218],"achieves":[223],"near-optimal":[224],"performance":[225],"all":[227],"near-real":[228],"world":[229],"while":[231],"remaining":[232],"stable":[233],"structural":[235],"This":[237],"simulation-driven":[238],"approach":[239],"provides":[240],"principled":[242],"basis":[243],"policy":[245],"supports":[248],"maximizing":[249],"return":[251],"on":[252],"investments":[254],"uncertain,":[256],"data-limited":[257],"environments.":[258]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-16T00:00:00"}