An efficient alternative to the exact evaluation of the quickest path flow network reliability problem

DOI10.1016/j.cor.2016.06.010zbMath1349.90180OpenAlexW2424128941MaRDI QIDQ342541

Mohammad Hasan, M. Dambrine

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.06.010

zbMATH Keywords

reliabilityminimal pathquickest pathMonte-Carlo simulationarc capacityarc lead timeflow networkinclusion-exclusionpath capacitypath lead timepath transmission time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Monte Carlo methods (65C05) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (4)

Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the quickest path problem and the reliable quickest path problem
• Stochastic computer network under accuracy rate constraint from QoS viewpoint
• The transform likelihood ratio method for rare event simulation with heavy tails
• The quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• On the quickest path problem
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• An algorithm for the quickest path problem
• A new simulation method based on the RVR principle for the rare event network reliability problem
• The quickest path problem with interval lead times
• Topological optimization of reliable networks under dependent failures
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• An algorithm for ranking quickest simple paths
• The all-pairs quickest path problem
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• A comprehensive survey on the quickest path problem
• Handbook of Monte Carlo Methods
• Reliable and Restricted Quickest Path Problems
• A new importance sampling Monte Carlo method for a flow network reliability problem

This page was built for publication: An efficient alternative to the exact evaluation of the quickest path flow network reliability problem