國立台灣科技大學-專利商品網-研發人才-洪政煌

EDBA/EMBA

學經歷：
	學歷: 1999 - 2003 : 喬治亞理工學院工業工程博士 1992 - 1994 : 國立交通大學交通運輸研究所博士班 1990 - 1992 : 國立交通大學交通運輸研究所碩士經歷: 2004~present : 台灣科技大學資訊管理學系專任助理教授 1999 - 2003 : 喬治亞理工學院工業及系統工程學系教學助理 1999 - 2003 : 喬治亞理工學院物流工程研究所教學助理 1995 - 1999 : 交通部台灣區國道新建工程局約聘工程師 1994 - 1995 : 台灣省住宅及都市發展局約僱幫工程司

專業技術
	教授課程：多變量分析網路流量模式與應用管理數學決策分析決策分析與管理供應鏈管理研究領域： Optimization Operations Research Transportation Algorithms Network Flow Models Combinatorial Optimization Inverse Optimization

研究成果與計畫
	國科會計畫 Risk Management Framework and Evaluation Model for Near Field Communication (NFC) Applications (NSC 99-2218-E-011-013) Applied Multidimensional Multiple-Choice Knapsack Problem on Web Service Composition Model (NSC 97-2410-H-011-007) The Value of Trading Bandwidth – From the Service Provider’s Perspective (NSC 95-2416-H-011-012) 期刊論文及著作 A heuristic algorithm for low-connectivity network design problem. In preparation for journal submission. Cheng-Huang Hung and Pei-Chi Chen. Heuristic algorithms for web service selection problem. Submitted to European Journal of Operational Research. Cheng-Huang Hung. Inverse shortest path length problems in telecommunication bandwidth pricing. Submitted to European Journal of Operational Research. Mine-Tsan Juan, Yue-Li Wang, and Cheng-Huang Hung. The l-Knot Number of Chordal Rings R(2t,{t}). Submitted. Cheng Huang Hung, Yue-Li Wang and Jun-Lin Guo. On Regular Multipartite Subtournaments of Almost Regular Tournaments. Submitted to Journal of Graph Theory. Yue Li Wang, Jun Lin Guo, Cheng Huang Hung and Hung-Chang Chan. Circuits of Each Length in Tournaments. Submitted. On the Inverse Shortest Path Length Problem, Ph.D. Thesis. 危險物品最適運送路線之評估，第一屆運輸網路研討會. 低放射性核能廢料運送路線選擇之多目標0-1整數規劃,Volume 10, 1,管理科學學報. 低放射性廢料陸運路線選擇與運送管制方式之研究,Master Thesis.uristic algorithm for low 研討會論文 Cheng-Huang Hung and Wun-Ting Huang, 2009 Oct., “Improved Sbihi's Algorithm to Solve the Multidimensional Multiple-choice Knapsack Problem”, INFORMS Annual Meeting, San Diego, USA. Chih-Chi Hu and Cheng-Huang Hung, 2009 Oct., “Decomposition Heuristic Algorithm for Low-connectivity Network Design Problem”, INFORMS Annual Meeting, San Diego, USA. Cheng-Huang Hung and Pei-Chi Cheng, 2007. Heuristic algorithms for multidimensional multiple-choice knapsack problem. INFORMS annual meeting 2007. Cheng-Kang Chen and Cheng-Huang Hung, 2006. Multi-depot multi-vehicle-type vehicle scheduling problem: TSN vs. CBN. INFORMS annual meeting 2006. Cheng-Huang Hung and Chia-He Lin, 2006. Wireless network access point location problem under level of service constraints. INFORMS annual meeting 2006. 陳正綱,洪政煌,陳智元,陳志騰,劉金維,陳冠樺,2006 Nov.”,Multi-depot Multi-vehicle-type Vehicle Scheduling Problem”, 第三屆台灣作業研究學會年會暨2006年作業研究理論與實務學術研討會,桃園,台灣. Solving the Inverse Shortest Path Problem, INFORMS annual meeting 2003. Inverse Shortest Path Length Problem, INFORMS annual meeting 2002. The distance Specific Inverse Multi-Commodity Flow Problem, INFORMS annual meeting 2001.