Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference35 articles.
1. Young-Cheol B, Nageswara SVR, Radhakrishnan S. Algorithms for all-pairs reliable quickest paths. In: Sloot, et al., (ed.). Computational Science ICCS 2003, Lecture Notes in Computer Science, vol. 2658. Springer, Berlin Heidelberg, 2003. p. 678–84.
2. Topological optimization of reliable networks under dependent failures;Barrera;Oper Res Lett,2015
3. A new importance sampling Monte–Carlo method for a flow network reliability problem;Bulteau;Nav Res Logist (NRL),2002
4. The quickest path problem with interval lead times;Calvete;Comput Oper Res,2004
5. Algorithms for the quickest path problem and the reliable quickest path problem;Calvete;Comput Manag Sci,2012
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献