··学院主页·院长信箱·书记信箱·联系我们 ·FAQ本科 | 硕士 | 博士 | MBA | EMBA | MPAcc | EDP
English Version

吴庆华

副教授

管理科学与信息管理系     

研究方向: 运筹学与最优化,组合拍卖,算法设计,运输系统管理,网络建模与优化,车辆路径优化
电    话: 18507150243
电子邮件: qinghuawu1005@gmail.com

  教育背景:


  法国昂热大学计算机学院, 博 士


  华中科技大学计算机学院, 工学硕士


  华中科技大学机械学院, 工学学士


  研究兴趣:


  运筹调度,优化算法理论及其应用: 基础设施投资与优化,资源调度与分配,组合拍卖,车辆路径优化,布局优化,频率分配


  智能优化算法: 禁忌算法,启发式算法,进化算法,自适应搜索算法,迭代局部搜索,Scatter Search, GRASP, Path-Relinking.


  经典NP难组合优化问题: 图着色(GCP), 最大团(MCP), Max-Cut, Max-Bisection, Sum Coloring, Complex Networks.


 


承担在研项目


  1.考虑劳动力管理下的车辆路径问题研究(国家自然科学基金青年项目71401059) 2015-2017, 主持


曾获荣誉



       1 入选2014香江学者计划


        2美国数学建模竞赛二等奖指导教师




 


  已发表SCI论文:


         1. Qinghua Wu and Jin-Kao Hao. A review on algorithms for maximum clique problems. European Journal of Operational Research ,242(3):  693-709, 2015. (A类论文,SSCI & SCI IF = 2.038)


  2. Qinghua Wu and Jin-Kao Hao. A Hybrid Metaheuristic Method for the Maximum Diversity Problem. European Journal of Operational Research 231(2):452—464,2013. (A类论文,SSCI & SCI IF = 2.038)


        3. Qinghua Wu, Zhipeng Lu, Yang Wang. A tabu search based hybrid evolutionary algorithm for the max-cut problem. Applied Soft Computing, in press, 2015(A类论文,SCI IF = 2.868)


        4. Qinghua Wu and Jin-Kao Hao. Solving the winner determination problem via a weighted maximum clique heuristic. Expert Systems with Applications,42(1): 355-365, 2015. (A类论文,SCI, IF = 1.909)


  5. Qinghua Wu and Jin-Kao Hao. Coloring large graphs based on independent set extraction. Computers & Operations Research 39(2): 283–290, 2012. (A类论文,SCI, IF = 1.909)


  6. Qinghua Wu and Jin-Kao Hao. An effective heuristic algorithm for sum coloring of graphs . Computers & Operations Research 39(7): 1593–1600, 2012. (A类论文,SCI, IF = 1.909)


  7. Qinghua Wu and Jin-Kao Hao. Memetic search for the max-bisection problem. Computers & Operations Research 40(1): 166–179, 2013. (A类论文,SCI, IF = 1.909)


  8. Qinghua Wu, Jin-Kao Hao, Fred Glover. Multi-neighborhood tabu search for the maximum weight clique problem. Annals of Operations Research 196(1): 611-634, 2012. (SCI, IF = 1.209)


  9. Qinghua Wu and Jin-Kao Hao. An adaptive multistart tabu search approach to solve the maximum clique problem. Journal of Combinatorial Optimization, 26(1): 86-108, 2013. (SCI)


  10. Qinghua Wu and Jin-Kao Hao. An extraction and expansion approach for graph coloring. Accepted to Asia-Pacific Journal of Operational Research May 2011 and to appear in 2013. (SCI)


  11. Jin-Kao Hao and Qinghua Wu. Improving the extraction and expansion method for large graph coloring. Discrete Applied Mathematics 160(16–17): 2397-2407, 2012. (SCI,导师第一作者,本人第二作者).