期刊論文| 1. | Amer, P.D.(1982)。A measurement center for the NBS local area computer network。IEEE Transactions on Computers，31，723-729。   |
| 2. | Chen, G.H.、Y.C. Hung(1993)。On the quickest path problem。Information Processing Letters，46，125-128。 |
| 3. | Chen, G.H.、Y.C. Hung(1994)。Algorithms for the constrained quickest path problem and the enumeration of quickest paths。Computers and Operations Research，21，113-118。 |
| 4. | Chen, Y.L.(1993)。An algorithm for finding the k quickest paths in a network。Computers and Operations Research，20，59-65。 |
| 5. | Cheng, S.T.(1998)。Topological optimization of a reliable communication network。IEEE Transactions on Reliability，47，225-233。 |
| 6. | Chen, Y.L.(1994)。Finding the k quickest simples paths in a network。Information Processing Letters，50，89-92。 |
| 7. | Clímaco, J.C.N.、M.M.B. Pascoal、J.M.F. Craveirinha、M.E.V. Captivo(2007)。Internet packet routing: application of a K-quickest path algorithm。European Journal of Operational Research，181，1045-1054。 |
| 8. | Feldmann, A.、A. Greenberg、N. Reingold、C. Lund、J. Rexford、F. True(2001)。Deriving traffic demands for operational IP networks: methodology and experience。IEEE/ACM Transactions on Networking，3，265-279。 |
| 9. | Feng, H.L.、S.Y. Liu(2010)。Reliability analysis of a wireless sensor network based on a physical model。Journal of the Chinese Institute of Industrial Engineers，27(1)，22-27。 |
| 10. | Hung, Y.C.、G.H. Chen(1992)。Distributed algorithms for the quickest path problem。Parallel Computing，18，823-834。 |
| 11. | Jain, R.、S.A. Routhier(1986)。Packet trains: measurements and a new model for computer network traffic。IEEE Journal on Selected Areas Communications，4，986-995。 |
| 12. | Lee, D.T.、E. Papadopoulou(1993)。The all-pairs quickest path problem。Information Processing Letters，45，261-267。 |
| 13. | Lin, Y.K.(2002)。Study on the performance index for a multicommodity stochastic-flow network in terms of minimal cuts。Journal of the Chinese Institute of Industrial Engineers，19(3)，42-48。 |
| 14. | Lin, Y.K.(2003)。On the multicommodity reliability for a stochastic- flow network with node failure under budget constraint。Journal of the Chinese Institute of Industrial Engineers，20(1)，42-48。 |
| 15. | Lin, Y. K.(2009)。Time version of the shortest path problem in a stochastic-flow network。Journal of Computational and Applied Mathematics，228，150-157。 |
| 16. | Lin, Y. K.(2010)。System reliability of a stochastic-flow network through two minimal paths under time threshold。International Journal of Production Economics，124，382-387。 |
| 17. | Lin, J.S.、C.C. Jane、J. Yuan(1995)。On reliability evaluation of a capacitated-flow network in terms of minimal pathsets。Network，25，131-138。 |
| 18. | Martins, E.D.Q.V.、J.L.E.D. Santos(1997)。An algorithm for the quickest path problem。Operations Research Letters，20，195-198。 |
| 19. | Mori, T.、T. Takine、J. Pan、R. Kawahara、M. Uchida、S. Goto(2007)。Identifying heavy-hitter flows from sampled flow statistics。IEICE Transactions on Communications，E90-B，3061-3072。 |
| 20. | Park, C.K.、S. Lee、S. Park(2004)。A label-setting algorithm for finding a quickest path。Computers and Operations Research，31，2405-2418。 |
| 21. | Ramirez-Marquez, J.E.、C.M. Rocco(2009)。Stochastic network interdiction optimization via capacitated network reliability modeling and probabilistic solution discovery。Reliability Engineering and System Safety，94，913-921。 |
| 22. | Ramirez-Marquez, J.E.、S.C.M. Rocco、G. Levitin(2009)。Optimal protection of general source-sink networks via evolutionary techniques。Reliability Engineering and System Safety，94，1676-1684。 |
| 23. | 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。 |
| 24. | Yeh, W. C.(2005)。A new approach to evaluating reliability of multistate networks under the cost constraint。Omega，33，203-209。 |
| 25. | Lin, Y. K.(2003)。Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network。Computers and Operations Research，30，567-575。 |
| 26. | Aven, T.(1985)。Reliability evaluation of multistate systems with multistate components。IEEE Transactions on Reliability，34(5)，473-479。 |
| 27. | 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。 |
| 28. | Xue, J.(1985)。On multistate system analysis。IEEE Transactions on Reliability，R-34(4)，329-337。 |
| 29. | Zuo, M. J.、Tian, Z.、Huang, H. Z.(2007)。An efficient method for reliability evaluation of multistate networks given all minimal path vector。IIE Transactions，39(8)，811-817。 |
| 30. | Yeh, W. C.(2004)。Multistate network reliability evaluation under the maintenance cost constraint。International Journal of Production Economics，88(1)，73-83。 |
| 31. | 游崑慈、沈群英(20110300)。Service Quality Management by Expanded Traditional Importance: Performance Analysis。工業工程學刊，28(2)，146-154。 延伸查詢 |
| 32. | Chen, Y. L.、Chin, Y. H.(1990)。The quickest path problem。Computers and Operations Research，17(2)，153-161。 |
| 33. | Chen, Y. L.、Tang, K.(1998)。Minimum time paths in a network with mixed time constraints。Computers and Operations Research，25(10)，793-805。 |
| 34. | 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(3)，354-361+368。 |
| 35. | Levitin, G.、Lisnianski, A.(2001)。A new approach to solving problems of multi-state system reliability optimization。Quality Reliability Engineering International，17，93-104。 |
| 36. | 林義貴(20100300)。The Stochastic Quickest Path Problem Via Minimal Paths。工業工程學刊，27(2)，132-139。 |
| 37. | 桑慧敏、邱文琪、劉信龍、Goldsman, David(20100100)。Importance Sampling Techniques for Estimating the Bit Error Rate in Digital Communication Systems。工業工程學刊，27(1)，1-14。 延伸查詢 |