聂嘉明副研究员到岗

发布人：网站管理员 发布日期：2017-07-20

2017年7月19日，聂嘉明副研究员完成报到手续。

聂嘉明老师基本资料：

教育背景:

  1. 2013.08-2017.07, 清华大学数学科学系, 运筹学与控制论, 博士
  2. 2011.08-2013.07, 清华大学数学科学系, 运筹学与控制论, 硕士
  3. 2007.08-2011.07, 复旦大学数学科学学院, 信息与计算科学, 学士

 

研究领域:

组合优化, 运筹学及其应用, 近似算法, 计算复杂性

 

论文发表:

期刊文章

  1. Nip K., Wang Z. and Wang Z. Knapsack with Variable Weights Satisfying Linear Constraints, Journal of Global Optimization, forthcoming, 2017.
  2. Wang Z. and Nip K. Bin packing under Linear Constraints. Journal of Combinatorial Optimization, forthcoming, 2017.
  3. Nip K., Wang Z. and Xing W. A Study on Several Combination Problems of Classic Shop Scheduling and Shortest Path. Theoretical Computer Science, 654, 175-187, 2016.
  4. Nip K., Wang Z. and Wang Z. Scheduling under Linear Constraints. European Journal of Operational Research, 253(2), 290-297, 2016.
  5. Talla Nobibon, F., Leus, R., Nip K. and Wang, Z. Resource Loading with Time Windows. European Journal of Operational Research, 244(2), 404-416, 2015.
  6. Nip K., Wang Z., Talla Nobibon F. and Leus R. A Combination of Flow Shop Scheduling and the Shortest Path Problem. Journal of Combinatorial Optimization, 29(1), 36-52, 2015.

 

国际会议文章

  1. Nip K., Wang Z. and Xing W. Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. In: Xu, D. et al. (eds.) The 21th Annual International Computing and Combinatorics Conference (COCOON 2015), Lecture Notes in Computer Science, vol. 9198, pp. 97–108. Springer, Switzerland, 2015.
  2. Talla Nobibon F., Leus R., Nip K. and Wang Z. Resource Loading: Applications and Complexity Analysis. The 11th International Symposium on Operations Research and its Applications in Engineering, Technology, and Management (ISORA 2013), Huangshan (China), August 23-25, 2013.
  3. Nip K. and Wang Z. Combination of Two-machine Flow Shop Scheduling and Shortest Path Problems. In: Du, D.Z., Zhang, G. (eds.) The 19th Annual International Computing and Combinatorics Conference (COCOON 2013), Lecture Notes in Computer Science, vol. 7936, pp. 680–687. Springer, Heidelberg, 2013.