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]