![朱文興[福州大學數學與計算機科學學院博士生導師]](/img/1/88a/nBnauM3X2QDM5ADNzAjM4YTM1UTM1QDN5MjM5ADMwAjMwUzLwIzLzUzLt92YucmbvRWdo5Cd0FmLzE2LvoDc0RHa.jpg "朱文興[福州大學數學與計算機科學學院博士生導師]")
人物經歷
1985-1989 上海大學數學系 套用數學專業 本科。
1989-1992 上海大學數學系 運籌學與控制論專業 碩士研究生。
1993-1996 上海大學數學系 運籌學與控制論專業 博士研究生。
1996-1999 福州大學計算機科學與技術系 講師。
1999-2004 福州大學計算機科學與技術系 副教授。
2004-2006 福州大學離散數學與理論計算機科學研究中心 教授。
2006- 福州大學離散數學與理論計算機科學研究中心 教授、博士生導師。
研究方向
主要從事NP困難離散與連續全局最佳化問題的算法設計與分析，以及超大規模積體電路計算機輔助設計中的算法等方面的研究。
主要貢獻
科研項目
1. 國家自然科學基金資助項目 超大規模積體電路布局的ell-1模最佳化模型及其算法研究，2012.1-2015.12.
2. 國家自然科學基金資助項目 超大規模積體電路多目標劃分的算法研究，2011.1-2011.12.
3. 教育部高校博士點專項科研基金聯合資助課題 高維非線性整數規劃的算法及其在VLSI電路劃分中的套用，2010.1-2012.12.
4. 國家自然科學基金資助項目 非數值離散最佳化的填充函式算法研究， 2008.1-2010.12.
5. 國家自然科學基金資助項目（10301009）: 非線性整數規劃和連續全局最佳化的填充函式算法研究，2004.1-2006.12.
1. 國家973項目“信息及相關領域若干重大需求的套用數學研究”（2011CB808000）之課題“大規模積體電路物理設計中關鍵套用數學理論和方法”，2011.1-2015.12.
2. 國家自然科學基金重點項目 極值圖論， 2010.1 – 2013.12.
3. 國家973項目“數學與其它領域交叉的若干專題”（2006CB805900）之課題“大規模積體電路設計中的圖論與代數方法”，2006.5-2010.12.
代表性論文
Jianli Chen, Wenxing Zhu, An Analytical Placer for VLSI Standard Cell Placement, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, accepted for publication.
Jiarui Chen, Wenxing Zhu, A dynamic convexized method for VLSI circuit partitioning, Optimization Methods and Software, Online at:
Wenxing Zhu, Geng Lin, M.M. Ali, Max-k-Cut by the discrete dynamic convexized method, INFORMS Journal on Computing, Online at:
Geng Lin, Wenxing Zhu, M. M. Ali, An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable, Journal of Global Optimization, Vol. 50, No. 4, pp. 657-673, 2011.
Jianli Chen, Wenxing Zhu, M. M. Ali, A hybrid simulated annealing algorithm for non-slicing VLSI floorplanning, IEEE Transactions on Systems, Man, and Cybernetics—Part C: Applications and Reviews, Vol. 41, No. 4, pp. 544-553, 2011.
Wenxing Zhu, Geng Lin, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Computers andOperations Research, Vol. 38, pp. 1792-1804, 2011.
Wenxing Zhu, M. Ali, Solving nonlinearly constrained global optimization problem via an auxiliary function method, Journal ofComputational and Applied Mathematics, 230(2), 491-503, 2009.
Wenxing Zhu, M. Ali, Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming, Computers and Operations Research, Vol. 36, No. 10, 2723-2728, 2009.
Wenxing Zhu, A discrete dynamic convexized method for nonlinear integer programming, Journal of Computational andAppliedMathematics，223(1): 356–373, 2009.
Wenxing Zhu, Dynamic globally concavized filled function method for continuous global optimization, Journal of OptimizationTheory and Applications，139(3): 635–648, 2008.
Wenxing Zhu, A provable better Branch and Bound method for a nonconvex integerquadratic programming problem, Journal of Computerand System Sciences, 70(1): 107-117, 2005.
Wenxing Zhu, Penalty parameter for linearly constrained 0-1 quadratic programming, Journal of Optimization Theory and Applications, 116（1）: 229-239, January, 2003.
朱文興, 傅清祥, 基於填充函式變換的對稱TSP問題的局部搜尋算法, 計算機學報， Vol. 25, No. 7, 2002, pp. 701-707.
1.Jianli Chen, Wenxing Zhu, An Analytical Placer for VLSI Standard Cell Placement, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, accepted for publication.
2.Jiarui Chen, Wenxing Zhu, A dynamic convexized method for VLSI circuit partitioning, Optimization Methods and Software, Online at:
3.Wenxing Zhu, Geng Lin, M.M. Ali, Max-k-Cut by the discrete dynamic convexized method, INFORMS Journal on Computing, Online at:
4.Geng Lin, Wenxing Zhu, M. M. Ali, An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable, Journal of Global Optimization, Vol. 50, No. 4, pp. 657-673, 2011.
5.Jianli Chen, Wenxing Zhu, M. M. Ali, A hybrid simulated annealing algorithm for non-slicing VLSI floorplanning, IEEE Transactions on Systems, Man, and Cybernetics—Part C: Applications and Reviews, Vol. 41, No. 4, pp. 544-553, 2011.
6.Wenxing Zhu, Geng Lin, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Computers andOperations Research, Vol. 38, pp. 1792-1804, 2011.
7.Wenxing Zhu, M. Ali, Solving nonlinearly constrained global optimization problem via an auxiliary function method, Journal ofComputational and Applied Mathematics, 230(2), 491-503, 2009.
8.Wenxing Zhu, M. Ali, Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming, Computers and Operations Research, Vol. 36, No. 10, 2723-2728, 2009.
9.Wenxing Zhu, A discrete dynamic convexized method for nonlinear integer programming, Journal of Computational andAppliedMathematics，223(1): 356–373, 2009.
10.Wenxing Zhu, Dynamic globally concavized filled function method for continuous global optimization, Journal of OptimizationTheory and Applications，139(3): 635–648, 2008.
11.Wenxing Zhu, A provable better Branch and Bound method for a nonconvex integerquadratic programming problem, Journal of Computerand System Sciences, 70(1): 107-117, 2005.
12.Wenxing Zhu, Penalty parameter for linearly constrained 0-1 quadratic programming, Journal of Optimization Theory and Applications, 116（1）: 229-239, January, 2003.
13.朱文興, 傅清祥, 基於填充函式變換的對稱TSP問題的局部搜尋算法, 計算機學報， Vol. 25, No. 7, 2002, pp. 701-707.
獲獎記錄
1.2011年指導博士生陳建利獲國際運籌學與控制論博士生論壇優秀論文三等獎.
2.2009年指導博士生林耿獲華東地區運籌學與控制論博士生論壇優秀論文二等獎.
3.2009年“預就業人才培養模式的創新與實踐”項目獲第六屆高等教育國家級教學成果獎二等獎(排名第三).
4.2009年“預就業人才培養模式的創新與實踐”項目獲福建省教學成果獎特等獎(排名第三).
5.2005年“《算法與數據結構》課程建設”項目獲福建省優秀教學成果一等獎(排名第五).
