期刊論文| 1. | Lin, Y. K.(2011)。Network reliability of a time-based multistate network under spare routing with p minimal paths。IEEE Transactions on Reliability，60(1)，61-69。   |
| 2. | Chen, G. H.、Hung, Y. C.(1994)。Algorithms for the constrained quickest path problem and the enumeration of quickest paths。Computers & Operations Research，21(2)，113-118。 |
| 3. | Climaco, J. C. N.、Pascoal, M. M. B.、Craveirinha, J. M. F.、Captivo, M. E. V.(2007)。Internet packet routing: application of a K-quickest path algorithm。European Journal of Operational Research，181(3)，1045-1054。 |
| 4. | Lin, Y. K.(2009)。System reliability evaluation for a multistate supply chain network with failure nodes by using minimal paths。IEEE Transactions on Reliability，58，34-40。 |
| 5. | Aven, T.(1985)。Reliability evaluation of multistate systems with multistate components。IEEE Transactions on Reliability，34(5)，473-479。 |
| 6. | Lin, J.-S.、Jane, C.-C.、Yuan, J.(1995)。On reliability evaluation of a capacitated-flow network in terms of minimal pathsets。Networks，25(3)，131-138。 |
| 7. | Lin, Y. K.(2001)。A simple algorithm for reliability evaluation of a stochastic-flow network with node failure。Computers and Operations Research，28(13)，1277-1285。 |
| 8. | Xue, J.(1985)。On multistate system analysis。IEEE Transactions on Reliability，R-34(4)，329-337。 |
| 9. | Yeh, W. C.(2004)。Multistate network reliability evaluation under the maintenance cost constraint。International Journal of Production Economics，88(1)，73-83。 |
| 10. | Yeh, W. C.(2005)。A new approach to evaluate reliability of multistate networks under the cost constraint。Omega，33，203-209。 |
| 11. | Chen, Y. L.、Chin, Y. H.(1990)。The quickest path problem。Computers & Operations Research，17(2)，153-161。 |
| 12. | Chen, G. H.、Hung, Y. C.(1993)。On the quickest path problem。Information Processing Letters，46(3)，125-128。 |
| 13. | Chen, Y. L.(1994)。Finding the k quickest simple paths in a network。Information Processing Letters，50，89-92。 |
| 14. | Dasgupta, M.、Biswas, G. P.(2012)。Design of multi-path data routing algorithm based on network reliability。Computers & Electrical Engineering，38(6)，1433-1443。 |
| 15. | Jane, C. C.、Lin, J. S.、Yuan, J.(1993)。Reliability evaluation of a limited-flow network in terms of minimal cutsets。IEEE Transactions on Reliability，42，354-361。 |
| 16. | Levitin, G.、Lisnianski, A.(2001)。A new approach to solving problems of multi-state system reliability optimization。Quality and Reliability Engineering International，17，93-104。 |
| 17. | Lin, Y. K.(2003)。On the multi-commodity reliability for a stochastic-flow network with node failure under budget constraint。Journal of the Chinese Institute of Industrial Engineers，20，42-48。 |
| 18. | Lin, Y. K.(2009)。Optimal routing policy of a stochastic-flow network。Computers & Industrial Engineering，56(4)，1414-1418。 |
| 19. | Martins, E. D. Q. V.、dos Santos, J. L. E. D.(1997)。An algorithm for the quickest path problem。Operations Research Letters，20，195-198。 |
| 20. | Pascoal, M. M. B.、Captivo, M. E. V.、Clímaco, J. C. N.(2005)。An algorithm for ranking quickest simple paths。Computers & Operations Research，32(3)，509-520。 |
| 21. | Ramirez-Marquez, J. E.、Coit, D. W.(2007)。Multi-state component criticality analysis for reliability improvement in multi-state systems Reliability。Reliability Engineering & System Safety，92，1608-1619。 |
| 22. | Yeh, W. C.(2008)。A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability。Reliability Engineering & System Safety，93(1)，125-136。 |
| 23. | Chen, Y. L.(1993)。An algorithm for finding the k quickest paths in a network。Computers & Operations Research，20，59-65。 |
| 24. | Chen, Y. L.、Tang, K.(1998)。Minimum time paths in a network with mixed time constraints。Computers & Operations Research，25(10)，793-805。 |
| 25. | Lee, D. T.、Papadopoulou, E.(1993)。The all-pairs quickest path problem。Information Processing Letters，45(5)，261-267。 |
| 26. | 林義貴(20100300)。The Stochastic Quickest Path Problem Via Minimal Paths。工業工程學刊，27(2)，132-139。 |
| 27. | Park, C. K.、Lee, S.、Park, S.(2004)。A label-setting algorithm for finding a quickest path。Computers & Operations Research，31，2405-2418。 |
| 28. | 桑慧敏、邱文琪、劉信龍、Goldsman, David(20100100)。Importance Sampling Techniques for Estimating the Bit Error Rate in Digital Communication Systems。工業工程學刊，27(1)，1-14。 延伸查詢 |
| 29. | Yeh, W. C.(1998)。A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network。IEEE Transactions on Reliability，47，436-442。 |
| 30. | Fredman, Michael L.、Tarjan, Robert Endre(1987)。Fibonacci heaps and their uses in improved network optimization algorithms。Journal of the Association for Computing Machinery，34(3)，596-615。 |