歷年著作目錄
期刊論文

　

  1. 溫于平、陳彥良(1985)，採購決策支援系統的分析與設計，管理科學學報，Vol. 2， No. 2，pp. 187-203. (TSSCI)
  2. Chen, Y. L. and Chin, Y. H. (1989), Scheduling unit-time jobs on processors with different capabilities, Computers & OR, Vol. 16, pp. 409-417. (Expanded SCI)
  3. Chen, Y. L. and Chin, Y. H. (1990), The quickest path problem, Computers & OR, Vol. 17, pp. 153-161. (SCI)
  4. Chen, Y. L. and Chin, Y.H. (1992), Multicommodity network flows with safety considerations, Operations Research, Vol. 40, No. 1, Supp. 1, pp. 48-54, 1992. (SCI, SSCI)
  5. Chen, Y. L. (1993), An algorithm for finding the k quickest paths in a network, Computers & OR, Vol. 20, pp. 59-65. (SCI)
  6. Chen, Y. L. (1994), The hybrid spanning tree problem, European Journal of Operational Research, Vol. 77, pp. 179-188. (SSCI)
  7. Chen, Y. L. (1994), Scheduling jobs to minimize total cost, European Journal of Operational Research, Vol. 74, pp. 111-119. (SSCI)
  8. Chen, Y. L. (1994), Finding the k quickest simple paths in a network, Information Processing Letters, Vol. 50, pp. 89-92. (SCI)
  9. Chen, Y. L. (1995), The minimum average cost flow problem, European Journal of Operational Research, Vol. 81, pp. 561-570. (SSCI)
  10. Chen, Y. L. (1995), A parametric maximum flow algorithm for bipartite graphs with applications, European Journal of Operational Research, Vol. 80, pp. 226-235. (SSCI)
  11. Hsu, P. Y., Wang, J. L. and Chen, Y. L. (1997), A structural approach to specify data transformations in data warehouses, 資訊管理研究, Vol. 1, No. 2, pp. 83-102.
  12. Chen, Y. L., Rink, D. and Tang, K (1997), Critical path in an activity network with time constraints, European Journal of Operational Research, Vol. 100, pp. 122-133. (SSCI)
  13. Chen, Y. L. and Tang, K. (1997), Shortest paths in time-schedule network, International Journal of Operations and Quantitative Management, Vol. 3, pp. 157-173.
  14. Chen, Y. L. and Tang, K. (1998), Minimum time paths in a network with mixed time constraints, Computers & OR, Vol. 25, pp. 793-805. (SCI)
  15. 陳鴻嘉、許秉瑜、陳彥良 (1999)，WWW資料庫設計之研究, 資訊管理學報，第五卷，第二期，pp. 33-54. (TSSCI)
  16. 陳仕昇、許秉瑜 、陳彥良 (1999)，以可重複序列挖掘網路瀏覽規則之研究，資管評論，第九卷，pp. 53-72。
  17. Yang, H. H. and Chen, Y. L. (2000), Finding the critical path in an activity network with time-switch constraints, European Journal of Operational Research, Vol. 120, pp. 603-613. (SSCI)
  18. 陳彥良、陳仕昇、許秉瑜（2000），在序列式資料中挖掘序列規則，資訊管理學報，第六卷，第二期，pp. 167-182。(TSSCI)
  19. Chen, Y. L. and Yang, H. H. (2000), Shortest paths in traffic-light networks, Transportation Research: Part B, Vol. 34, pp. 241-253. (SSCI, SCI)
  20. 張元斌、許秉瑜、陳彥良(2000)，STRPN─多媒體時空關係展示延伸型Petri Net模式，資管評論，第十期，pp. 39-60。
  21. 陳彥良、凌俊青、許秉瑜(2001)，在包裹式資料庫中挖掘數量關連規則，資訊管理學報第七卷，第二期，pp. 215-229。(TSSCI)
  22. Chen, Y. L. and Rinks, D. and Tang, K. (2001), The first k minimum cost paths in a time-schedule network, Journal of Operational Research Society, Vol. 52, pp. 102-108. (SSCI)
  23. 沈清正、、、陳彥良等共七人(2002)，資料間隱含關係的挖掘與展望，資訊管理學報第九卷，專刊期，pp. 75-100。(TSSCI)
  24. Chen, Y. L. and Chen, S. S. and Hsu, P. Y. (2002)  Mining hybrid sequential patterns and sequential rules, Information Systems, Vol. 27, No. 5, pp. 345-362. (SCI)
  25. Chen, Y. L. and Yang, H. H. (2003) Minimization of travel time and weighted number of stops in a traffic-light network, European Journal of Operational Research, Vol. 144, No. 3, pp. 565-580. (SSCI)
  26. Hsu, P. Y., Chang, Y. B.  and Chen, Y. L. (2003), STRPN: A Petri Net approach for modeling spatial-temporal relations between moving multimedia objects, IEEE Trans on Software Engineering, Vol. 29, No. 1, pp. 63-76. (SCI)
  27. Chen, Y. L. and Hsiao, L. J. (2003). Shipping problems with body clock constraints, Computers & OR, Vol. 30, No. 7, pp. 1037-1049.  (SCI)
  28. Lin, Q.Y., Chen, Y. L. , Chen, J. S.  and Chen, Y. C. (2003). Mining Inter-Organizational Retailing Knowledge for an Alliance formed by Competitive Firms,  Information and Management, Vol. 40, No. 5, 431-442. (SSCI)
  29. 陳家仁、陳彥良、陳禹辰 (2003)，在少樣商品或短交易長度情況下挖掘關聯規則，資訊管理學報，第九卷，第二期，pp. 55-72。(TSSCI)
  30. Chen, Y. L., Chang-Ling Hsu and Shih-Chieh Chou. (2003) Constructing a multi-valued and multi-labeled decision tree, Expert Systems with Applications, Vol. 25, 199-209. (SCI)
  31. Chen, Y. L., Hsiao, L. J. and Tang K. (2003) Time analysis for planning a path in a time-window network, Journal of Operational Research Society. Vol. 54, pp. 860-870.  (SSCI)
  32. Chen, Y. L., Chiang M. C. and Kao M. T. (2003) Discovering time-interval sequential patterns in sequence databases, Expert Systems with Applications, Vol. 25, 343-354. (SCI)
  33. Chen, Y. L. and Yang, H. H. (2004) Finding the first K shortest paths in a time-window network, Computers & OR, Vol. 31, No. 4, pp. 499-513. (SSCI, SCI)
  34. Chen, Y. L. , Kao, H. P. and Ko, M.T. (2004), Mining DAG patterns from DAG databases, Lecture Notes in Computer Science, Vol. 3129, pp. 579-588. (SCI)
  35. Chen, Y. L. and Lu, J. T. (2004) Mining inheritance rules from genealogical data. Lecture Notes in Computer Science, Vol. 3129, pp. 569-578. (SCI)
  36. Hsu, P. Y., Chen, Y. L. and Ling C. C. [2004] Algorithms for mining association rules in bag databases, Information Sciences, Vol. 166, 2004, p 31-47. (SCI)
  37. Yang, H. H. and Chen, Y. L. (2005) Finding the K shortest paths in a traffic-light network, Computers & OR, Vol. 32, No. 3, pp. 571-581. (SCI)
  38. Yu, C. C. and Chen, Y. L., Mining sequential patterns from multi-dimensional sequence data, forthcoming in IEEE Trans on Knowledge and Data Engineering. (SCI)
  39. Chen, Y. L. ,  Tang, K., Shen, R. J.  and Hu Y. H., Market basket analysis in a multiple store environment, forthcoming in Decision Support Systems. (SCI)
  40. Chen, Y. L. and Shen, C. C., Mining generalized knowledge from ordered data through attribute-oriented induction techniques, forthcoming in European Journal of Operational Research. (SCI)

    41.  

     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
     
    　

　

研討會論文

　

  1. 陳彥良等 (2001)，"資料間隱含關係的挖掘與展望," 二十一世紀台灣湧現中的資訊管理議題專家研討會 ，大溪，鴻禧山莊。
  2. 陳彥良 (2000)，"在資料倉儲中挖掘知識的因難與挑戰,"  2000年產業資訊管理暨新興科技實務研討會，新莊，輔仁大學。
  3. 陳彥良、陳仕昇、許秉瑜 (2000)，"挖掘最有價值的前K個大項目集合," 第六屆資訊管理研究暨實務研討會，新竹，交通大學。
  4. 徐碧璘、陳彥良 (1998)，"建立核能電廠整體風險評估與管理模式決策支援系統," 第四屆國際資訊管理研究暨實務研討會，新莊，輔仁大學，第517-524頁。
  5. 徐碧璘、陳彥良 (1997)，"決策支援系統應用於核能電廠整體風險評估與管理模式之探討," 第三屆國際資訊管理研究暨實務研討會，嘉義，中正大學，第402-409頁。
  6. Y. L. Chen (1997), " Finding K Longest Paths In An Activity Network,” 1997企業管理國際研討會，東吳大學。
  7. Y. L. Chen (1992), "A Parametric Bipartite Maximum Flow Algorithm," International Computer Symposium, Taichung, Taiwan, pp. 1-8.
  8. Y. L. Chen (1992), "Scheduling Jobs with Minimize Cost," International Conference on Information and Systems, Dalian, China, pp. 298-307.
  9. Y. L. Chen (1991), "Finding Weighted Spanning Tree in a Network," National Computer Symposium, Chung-Li, Taiwan, pp. 212-216.
  10. Y. L. Chen (1991), "An Improved Algorithm for Scheduling on Heterogeneous Processors," National Computer Symposium, Chung-Li, Taiwan, pp. 172-177.
  11. Y. L. Chen and Y. H. Chin (1989), "Solving Constrained Shortest Path Problem in a Unified Way," International Conference on Computing and information, Toronto, Canada, pp. 57-63.
  12. Y. L. Chen and Y. H. Chin (1989), "Preemptive Scheduling on Heterogeneous Processors," International Conference on Computing and Information, Toronto, Canada, Vol. 2, pp. 104-108.

    13.