49
Views
17
CrossRef citations to date
0
Altmetric
Theoretical Paper

The Safest Escape problem

&
Pages 1749-1758 | Received 01 Apr 2007, Accepted 01 Jul 2008, Published online: 21 Dec 2017

References

  • AhujaRKMagnantiTLOrlinJBNetwork Flows: Theory, Algorithms and Applications1993
  • AndersonEJNashPLinear Programming in Infinite-Dimensional Spaces1987
  • AndersonEJPhilpottABA continuous-time network simplex algorithmNetworks19891939542510.1002/net.3230190403
  • AndersonEJNashPPhilpottABA class of continuous network flow problemsMath Opns Res1982750151410.1287/moor.7.4.501
  • AronsonJEA survey of dynamic network flowsAnn Opns Res19892016610.1007/BF02216922
  • BurkardREDlaskaRKKlinzBThe quickest flow problemZOR—Meth Model Opns Res1993373158
  • CaiXShaDWongCKTime-varying minimum cost flow problemsEur J Opl Res200113135237410.1016/S0377-2217(00)00059-X
  • CaiXShaDWongCKTime-varying universal maximum flow problemsMath Comput Model20013340743010.1016/S0895-7177(00)00252-1
  • CareyMHendricksonCBounds on expected performance of networks with links subject to failureNetworks19841443945610.1002/net.3230140307
  • ChalmetLFrancisRSaundersPNetwork models for building evacuationMngt Sci1982288610510.1287/mnsc.28.1.86
  • FordLRFulkersonDRFlows in Networks1962
  • FrankOGaulWOn reliability in stochastic graphsNetworks19821211912610.1002/net.3230120204
  • GlocknerGDNemhauserGLA dynamic network flow problem with uncertain arc capacities: formulation and problem structureOpns Res20004823324210.1287/opre.48.2.233.12384
  • GlocknerGDNemhauserGLToveyCADynamic network flow with uncertain arc capacities: decomposition algorithm and computational resultsComput Optim Appl20011823325010.1023/A:1011233219223
  • HajekBOgierRGOptimal dynamic routing in communication networks with continuous trafficNetworks19841445748710.1002/net.3230140308
  • HalpernJA generalized dynamic flows problemNetworks1979913316710.1002/net.3230090204
  • HamacherWTufekciSOn the use of lexicographic min cost flows in evacuation modelingNav Res Logist19873448750310.1002/1520-6750(198708)34:4<487::AID-NAV3220340404>3.0.CO;2-9
  • Hoppe B (1995). Efficient dynamic network flow algorithms. Technical Report TR95-1524, Department of Computer Science, Cornell University, Ithaca, NY.
  • HoppeBTardosEThe quickest transshipment problemMath Opns Res200025366210.1287/moor.25.1.36.15211
  • KarbowiczCMacGregor SmithJA k-shortest paths routing heuristic for stochastic network evacuation modelsEng Optim1984725328010.1080/03052158408960642
  • LinYKA simple algorithm for reliability evaluation of a stochastic-flow network with node failureComput Opns Res2001281277128510.1016/S0305-0548(00)00039-3
  • LinYKUsing minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcsReliab Eng Syst Safety200275414610.1016/S0951-8320(01)00110-7
  • Miller-HooksEKrauthammerTAn intelligent evacuation, rescue and recovery conceptFire Technol20074310712210.1007/s10694-006-8433-5
  • Miller-Hooks E and Sorrel G (2008). The maximal dynamic expected flows problem for emergency evacuation planning, Transportation Research Record (forthcoming).
  • Miller-HooksEStock PattersonSOn solving quickest time problems in time-dependent, dynamic networksJ Math Model Algorithms20043397110.1023/B:JMMA.0000026708.57419.6d
  • NagamochiHIbarakiTMaximum flows in probabilistic networksNetworks19912164566610.1002/net.3230210604
  • OgierRMinimum-delay routing in continuous-time dynamic networks with piecewise-constant capacitiesNetworks19881830331810.1002/net.3230180405
  • OrdaARomROn continuous network flowsOpns Res Lett199517273610.1016/0167-6377(94)00035-5
  • PhilpottABContinuous-time flows in networksMath Opns Res19901564066110.1287/moor.15.4.640
  • PullanMCAn algorithm for a class of continuous linear problemsSIAM J Control Optim1993311558157710.1137/0331073
  • PullanMCA study of general dynamic network programs with arc time-delaysSIAM J Optim1997788991210.1137/S1052623495288180
  • TalebiKMacGregor SmithJStochastic network evacuation modelsComput Opns Res19851255957710.1016/0305-0548(85)90054-1
  • YamadaTA network flow approach to a city emergency evacuation planningInt J Syst Sci19962793193610.1080/00207729608929296
  • ZiliaskopoulosAKMahmassaniHSTime-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applicationsTransport Res Record1993140894100

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.