{"id":"https://openalex.org/W784093069","doi":null,"title":"Mathematical programming algorithms for reliable routing and robust evacuation problems","display_name":"Mathematical programming algorithms for reliable routing and robust evacuation problems","alternate_titles":[],"publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W784093069","mag":"784093069"},"language":"en","primary_location":{"id":"mag:784093069","doi":null,"is_oa":false,"landing_page_url":"http://arizona.openrepository.com/arizona/bitstream/10150/195737/1/azu_etd_1733_sip1_m.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W784093069"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014791427","display_name":"Cole J. Smith","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cole J. Smith","raw_affiliation_strings":["The University of Arizona,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Arizona,","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082238346","display_name":"April K. Andreas","orcid":"https://orcid.org/0000-0002-0558-6819","observed_orcids":["https://orcid.org/0000-0002-0558-6819"]},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"April K. Andreas","raw_affiliation_strings":["The University of Arizona,"],"raw_orcid":"https://orcid.org/0000-0002-0558-6819","affiliations":[{"raw_affiliation_string":"The University of Arizona,","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I138006243"],"apc_list":null,"apc_paid":null,"fwci":0.3602,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55292545,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6753000020980835,"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.6753000020980835,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.2587999999523163,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.013500000350177288,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reliable-routing","display_name":"reliable routing","score":0.8640000224113464},{"id":"https://openalex.org/keywords/arc-disjoint-paths","display_name":"arc-disjoint paths","score":0.8050000071525574},{"id":"https://openalex.org/keywords/nonlinear-integer-programming","display_name":"nonlinear integer programming","score":0.8029999732971191},{"id":"https://openalex.org/keywords/branch-and-price-and-cut","display_name":"branch-price-and-cut","score":0.8970000147819519},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders decomposition","score":0.875},{"id":"https://openalex.org/keywords/disaster-scenarios","display_name":"disaster scenarios","score":0.6980000138282776},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7360000014305115}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6212314963340759},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5923352241516113},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5512099862098694},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5383397936820984},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5374610424041748},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5028755068778992},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48818475008010864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4760991334915161},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4503733217716217},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44243699312210083},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.4321635663509369},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.42440712451934814},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41056889295578003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37595435976982117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36702877283096313},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2407892644405365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15270879864692688},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10383632779121399},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:784093069","doi":null,"is_oa":false,"landing_page_url":"http://arizona.openrepository.com/arizona/bitstream/10150/195737/1/azu_etd_1733_sip1_m.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.7207000255584717,"display_name":"Industry, innovation and infrastructure"},{"id":"https://metadata.un.org/sdg/11","score":0.47999998927116394,"display_name":"Sustainable cities and communities"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W18450336","https://openalex.org/W1484866529","https://openalex.org/W1491580860","https://openalex.org/W1546581765","https://openalex.org/W1571070457","https://openalex.org/W1600853624","https://openalex.org/W1608168980","https://openalex.org/W1734243449","https://openalex.org/W1775310636","https://openalex.org/W1894750005","https://openalex.org/W1964443412","https://openalex.org/W1967565181","https://openalex.org/W1967940897","https://openalex.org/W1970355999","https://openalex.org/W1979880259","https://openalex.org/W1984647185","https://openalex.org/W1997556033","https://openalex.org/W2005926129","https://openalex.org/W2007990981","https://openalex.org/W2011039300","https://openalex.org/W2013479503","https://openalex.org/W2019637647","https://openalex.org/W2028316882","https://openalex.org/W2036900823","https://openalex.org/W2038700684","https://openalex.org/W2044121814","https://openalex.org/W2046265805","https://openalex.org/W2052890323","https://openalex.org/W2056802293","https://openalex.org/W2058479406","https://openalex.org/W2063190731","https://openalex.org/W2070176112","https://openalex.org/W2081855421","https://openalex.org/W2086522200","https://openalex.org/W2094169436","https://openalex.org/W2097414563","https://openalex.org/W2098074159","https://openalex.org/W2098968017","https://openalex.org/W2105972067","https://openalex.org/W2119433111","https://openalex.org/W2119591468","https://openalex.org/W2130626677","https://openalex.org/W2130679277","https://openalex.org/W2135638508","https://openalex.org/W2140844111","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2159176259","https://openalex.org/W2159272988","https://openalex.org/W2161637477","https://openalex.org/W2161704166","https://openalex.org/W2164057590","https://openalex.org/W2164878175","https://openalex.org/W2167580124","https://openalex.org/W2169528473","https://openalex.org/W2171830873","https://openalex.org/W2408262133","https://openalex.org/W2569646339"],"related_works":["https://openalex.org/W2034355834","https://openalex.org/W2104773527","https://openalex.org/W57710055","https://openalex.org/W7099024516","https://openalex.org/W3116465178","https://openalex.org/W2419430748","https://openalex.org/W1981914533","https://openalex.org/W4205546898","https://openalex.org/W167710240","https://openalex.org/W2021893319"],"abstract_inverted_index":{"Most":[0],"traditional":[1],"routing":[2,146],"problems":[3,117],"assume":[4],"perfect":[5],"operability":[6],"of":[7,29,153,241,250,268,332],"all":[8],"arcs":[9,107],"and":[10,75,102,136,162,183,233,279,307,315],"nodes.":[11],"However,":[12],"when":[13],"independent":[14],"arc":[15,275],"failure":[16],"probabilities":[17],"exist,":[18],"a":[19,50,73,150,160,265,289],"secondary":[20],"objective":[21],"must":[22,83,99],"be":[23,100,109,119],"present":[24],"to":[25,58,67,118,198,220,237,259,285],"retain":[26],"some":[27,88],"measure":[28],"expected":[30,296],"functionality.":[31],"We":[32,91,114,121,223,319],"first":[33],"briefly":[34],"consider":[35,92,142],"the":[36,44,61,93,103,112,126,143,167,187,199,212,217,239,247,295,324,330,338],"reliability-constrained":[37,62],"single-path":[38],"problem,":[39,64,147],"where":[40],"we":[41,141,204,245,283,308],"look":[42],"for":[43,124,186,211,228,312,322,337],"lowest":[45],"cost":[46],"path":[47,82,173],"that":[48,166,169,293],"meets":[49],"reliability":[51],"side":[52],"constraint.":[53],"This":[54],"analysis":[55],"enables":[56],"us":[57],"then":[59],"examine":[60,122,246],"two-path":[63],"which":[65,96,106,148,190,216,255],"seeks":[66,149],"establish":[68,286],"two":[69,206,225],"minimum-cost":[70,151],"paths":[71,98,158],"between":[72,111,159],"source":[74,161],"destination":[76,163],"node":[77],"wherein":[78],"at":[79,170],"least":[80,171],"one":[81,172],"remain":[84],"fully":[85],"operable":[86],"with":[87,271],"threshold":[89],"probability.":[90],"case":[94,104,188],"in":[95,105,189,215,254],"both":[97,116],"arc-disjoint":[101],"can":[108],"shared":[110],"paths.":[113,222],"prove":[115],"NP-hard.":[120],"strategies":[123],"solving":[125,229],"resulting":[127],"nonlinear":[128],"integer":[129,208],"program,":[130],"including":[131],"pruning,":[132],"coefficient":[133],"tightening,":[134],"lifting,":[135],"branch-and-bound":[137],"partitioning":[138],"schemes.":[139],"\r\nNext,":[140],"reliable":[144],"h-path":[145,201,213],"set":[152,267],"h":[154,191],"\u2265":[155],"2":[156,193],"arc-independent":[157],"node,":[164],"such":[165],"probability":[168],"remains":[174],"operational":[175],"is":[176,257,302],"sufficiently":[177],"large.":[178],"Our":[179],"prior":[180],"arc-based":[181],"models":[182],"algorithms":[184,227],"tailored":[185],"=":[192],"do":[194],"not":[195],"extend":[196],"well":[197],"general":[200],"problem.":[202],"Thus,":[203],"propose":[205,224],"alternative":[207],"programming":[209],"formulations":[210],"problem":[214,326,334],"variables":[218],"correspond":[219],"origin-destination":[221],"branch-and-price-and-cut":[226],"these":[230,242],"new":[231],"formulations,":[232],"provide":[234,309],"computational":[235],"results":[236],"demonstrate":[238],"efficiency":[240],"algorithms.":[243],"\r\nFinally,":[244],"robust":[248],"design":[249],"an":[251,287],"evacuation":[252,256,291,297],"tree,":[253],"subject":[258],"capacity":[260],"restrictions":[261],"on":[262,304],"arcs.":[263],"Given":[264],"discrete":[266],"disaster":[269],"scenarios":[270],"varying":[272],"network":[273],"populations,":[274],"capacities,":[276],"transit":[277],"times,":[278],"time-dependent":[280],"penalty":[281],"functions,":[282],"seek":[284],"optimal":[288],"priori":[290],"tree":[292],"minimizes":[294],"penalty.":[298],"The":[299],"solution":[300],"strategy":[301],"based":[303],"Benders":[305],"decomposition,":[306],"efficient":[310],"methods":[311],"obtaining":[313],"primal":[314],"dual":[316],"subproblem":[317],"solutions.":[318],"analyze":[320],"techniques":[321],"strengthening":[323],"master":[325,333],"formulation,":[327],"thus":[328],"reducing":[329],"number":[331],"solutions":[335],"required":[336],"algorithm's":[339],"convergence.":[340]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W784093069","counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
