DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS

DOI10.1017/S026996481700047XMaRDI QIDQ5056602zbMATH OpenOpenAlexFDO

Authors 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

dynamic networkevacuation systemquickest time distributionreliability

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for the quickest time distribution of dynamic stochastic-flow networks
• A fast network-decomposition algorithm and its applications to constant-time distributed computation
• On solving quickest time problems in time-dependent, dynamic networks
• A fast network-decomposition algorithm and its applications to constant-time distributed computation (extended abstract)
• Fast network decomposition
• Faster network algorithms based on graph decomposition
• Fast distributed network decompositions and covers
• Faster algorithms for shortest path and network flow based on graph decomposition
• Distributed shortest-path protocols for time-dependent networks
• On the Complexity of Distributed Network Decomposition

Cites work

• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Evacuation modeling: a case study on linear and nonlinear network flow models
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Integer programming and combinatorial optimization. 9th international IPCO conference, Cambridge, MA, USA, May 27--29, 2002. Proceedings
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
• Recursive Disjoint Products: A Review of Three Algorithms
• Reliable and restricted quickest path problems
• The quickest flow problem
• The quickest path problem

Cited in

(3)

• A fast network-decomposition algorithm and its applications to constant-time distributed computation
• Algorithms for the quickest time distribution of dynamic stochastic-flow networks
• Fast network decomposition

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056602)