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

DOI10.1016/J.COR.2016.06.010zbMATH Open1349.90180OpenAlexW2424128941MaRDI QIDQ342541FDOQ342541

Authors: M. El Khadiri, W.-C. Yeh 

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

Recommendations

• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Time version of the shortest path problem in a stochastic-flow network
• Algorithms for the quickest path problem and the reliable quickest path problem
• System reliability for quickest path problems under time threshold and budget
• Evaluating Reliability of Stochastic Flow Networks

zbMATH Keywords

reliabilityquickest pathMonte-Carlo simulationarc capacityarc lead timeflow networkinclusion-exclusionminimal pathpath capacitypath lead timepath transmission time

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• The quickest path problem with interval lead times
• 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
• A comprehensive survey on the quickest path problem
• Handbook of Monte Carlo Methods
• Algorithms for the quickest path problem and the reliable quickest path problem
• The quickest path problem
• Rare event analysis by Monte Carlo techniques in static models
• The transform likelihood ratio method for rare event simulation with heavy tails
• A new simulation method based on the RVR principle for the rare event network reliability problem
• Topological optimization of reliable networks under dependent failures
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• Reliable and restricted quickest path problems
• A new importance sampling Monte Carlo method for a flow network reliability problem
• Title not available (Why is that?)
• Stochastic computer network under accuracy rate constraint from QoS viewpoint

Cited In (6)

• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
• System reliability for quickest path problems under time threshold and budget
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks

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

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