韩乔明教授
作者: 来源: 时间:2024-03-05 浏览:
一、教师简介
韩乔明,温州商学院金贸学院教授,主要从事优化理论算法及其在经济管理中的应用研究,对图的剖分问题、点覆盖问题、报童问题以及投资组合等有深入的研究,发表学术论文二十余篇,其中国际顶尖运筹学期刊《Operations Research》两篇、《Mathematical Programming 》一篇。主持或者负责过六项国家自然科学基金的研究工作。
二、主讲课程:
证券投资分析,运筹学,概率论与统计学等。
三、代表性论文
[1] Qiaoming Han, Donglei Du, Dachuan Xu, Yicheng Xu, Approximate e?ciency and strategy-proofness for moneyless mechanisms on single-dipped policy domain, Journal of Global Optimization, Vol.70, 859-873, 2018.
[2] Qiaoming Han, Donglei Du, Luis F. Zuluaga, A risk- and ambiguity-averse extension of the max-min Newsvendor order formula, Operations Research, Vol.62(3), 535-542, 2014.
[3]Han, Qiaoming, Punnen, Abraham P. , 2012, Strong and weak edges of a graph and linkages with the vertex cover problem, Discrete Applied Mathematics , 160(3), pp197-203
[4]Han, Qiaoming, Punnen, Abraham P., Ye, Yinyu , 2009, An edge-reduction algorithm for the vertex cover problem, Operations Research Letters , 37(3), pp181-186
[5]Han, Qiaoming, Du, Donglei, Vera, Juan, Zuluaga, Luis F. , 2008, Improved bounds for the symmetric rendezvous value on the line, Operations Research , 56(3), pp772-782
[6]Han, Qiaoming, Sun, Wenyu, Han, Jiye, Sampaio, Raimudo J.B. , 2005, An adaptive conic trust-region method for unconstrained optimization, Optimization Methods & Software , 20(6), pp665-677
[7]Han, QM, Ye, YY, Zhang, JW , 2002, An improved rounding method and semidefinite programming relaxation for graph partition, Mathematical Programming , 92(3), pp509-535
[8]Han, QM, Ye, YY, Zhang, HT, Zh ang, JW , 2002, On approximation of max-vertex-cover, European Journal of Operational Research , 143(2), pp342-355
[9]Han, QM, Liao, LZ, Qi, HD, Qi, LQ , 2001, Stability analysis of gradient-based neural networks for optimization problems, Journal of Global Optimization , 19(4), pp363-381
[10]Han, QM, Han, JY , 2001, Revised filled function methods for global optimization, Applied Mathematics and Computation , 119(2-3), pp217-228
四、主持国家自然科学基金课题
[1]若干分布鲁班优化问题的理论与算法及其应用的研究,(项目编号:11771386),2018.1—2021.12。
[2]关于直线上对称相遇值问题及相关问题的研究(项目编号:11271009),2013.1—2016.12。
[3]关于点集覆盖问题近似算法及其相关问题的研究(项目编号:10971187),2010.12—2012.12。
[4]图的剖分问题中近似算法的研究(项目编号:10201011),2003.1--2005.12。