An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
From MaRDI portal
Publication:342541
DOI10.1016/j.cor.2016.06.010zbMath1349.90180MaRDI QIDQ342541
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
reliability; minimal path; quickest path; Monte-Carlo simulation; arc capacity; arc lead time; flow network; inclusion-exclusion; path capacity; path lead time; path transmission time
90C35: Programming involving graphs or networks
65C05: Monte Carlo methods
90B15: Stochastic network models in operations research
90B25: Reliability, availability, maintenance, inspection in operations research