DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS

DOI10.1017/S026996481700047XzbMath1502.90032OpenAlexW2791118502MaRDI QIDQ5056602

Chin-Chia Jane, Yih-Wenn Laih

Publication date: 8 December 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s026996481700047x

zbMATH Keywords

reliabilitydynamic networkquickest time distributionevacuation system

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Evacuation modeling: a case study on linear and nonlinear network flow models
• The quickest path problem
• Integer programming and combinatorial optimization. 9th international IPCO conference, Cambridge, MA, USA, May 27--29, 2002. Proceedings
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Reliable and Restricted Quickest Path Problems
• Recursive Disjoint Products: A Review of Three Algorithms
• The quickest flow problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• An Algorithm for Universal Maximal Dynamic Flows in a Network