Site menu:

Dr. DANG, Chuangyin

Photo of Dr. DANG

Associate Professor


PhD-Cum Laude(Tilburg), MSc(Xidian), BSc(Shanxi)

Email: mecdang@cityu.edu.hk

Homepage: personal.cityu.edu.hk/~mecdang/

Dr. Chuangyin Dang received his PhD degree (Cum Laude) in Operations Research/Economics from Tilburg University, the Netherlands, in 1991, MSc degree in Applied Mathematics from Xidian University, China, in 1986, and BSc degree in Computational Mathematics from Shanxi University, China, in 1983. Dr. Chuangyin Dang's research is in operations research/optimization and related fields. He is best known for developing the D1-triangulation of the Euclidean space and simplicial methods for integer programming. Because of these significant contributions, Dr. Dang has been awarded excellent researcher by Tilburg University, The Netherlands, in 1990 and invited to give talks on his creative work at universities such as Cornell University, Stanford University, the University of Michigan, the University of Minnesota, etc., and to work as Research Fellow at Yale University in 1994. He has published over 60 papers in journals including Mathematical Programming, Mathematics of Operations Research, SIAM Journal on Optimization, European Journal of Operational Research, Computational Optimization and Applications, IEEE Transactions on Evolutionary Computation, Neural Computation, Neural Networks, etc. Before joining City University of Hong Kong in 1998, he was Assistant Professor at the University of Auckland from 1993 to 1998, Delft University of Technology from 1992 to 1993, and the University of California from 1991 to 1992.



Research Interests


Awards and Honors

  1. Second-Prize Ministry Award for Progresses in Science and Technology, Ministry of Electronic Industries of China, China, 1993
  2. Excellent Research Award (Cash Prize of Two Thousand Guilders), Tilburg University, The Netherlands, 1990

Selected Recent Publications

  1. Y. Wang and C. Dang. An evolutionary algorithm for global optimization based on level-set evolution and Latin squares, IEEE Transactions on Evolutionary Computation 11 (2007) 579-595.


  2. C. Dang and M. Li. A floating-point genetic algorithm for solving the unit commitment problem, European Journal of Operational Research 181 (2007) 1370-1395.


  3. Z. Meng, C. Dang, and X. Yang. On the smoothing of the square-root exact penalty function for inequality constrained optimization, Computational Optimization and Applications 35 (2006) 375-398.


  4. C. Dang and L. Xu. A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem, Neural Computation 14 (2002) 303-324.


  5. C. Dang, L. He, and I.K. Hui. A deterministic annealing algorithm for approximating a solution of the max-bisection problem, Neural Networks 15 (2002) 441-458.

Last modified on 27 October, 2009