助理教授
所在位置 网站首页 > 师资队伍 > 专任教师 > 助理教授 > 正文
聂嘉明

职称:助理教授

职务:

学历:博士

电子邮件:kmnip@xmu.edu.cn

联系电话:0592-2580037

办 公 室:数理大楼519

教育经历:

2013.7-2017.7 理学博士,运筹学与控制论,清华大学数学科学系.

2011.8-2013.7 理学硕士,运筹学与控制论,清华大学数学科学系.

2007.8-2011.7 理学学士,信息与计算科学,复旦大学数学科学学院.

工作经历:

2020.8-至今 助理教授,数学科学学院,加拿大28预测在线预测可刮奖.

2017.7-2020.7 特聘副研究员,数学学院(珠海),中山大学.


研究方向:

运筹学及其应用,组合优化,算法分析与设计


获奖:

北京运筹学会2016 青年优秀论文二等奖


主持项目:

线性或非线性约束下一些排序问题的复杂性和算法,国家自然科学基金青年科学基金(No. 11801589),2019-2021,主持

论文:

(Journal Papers)

  • Wu Z., Nip K., He Q.✉ A new combinatorial algorithm for separable convex resource allocation with nested bound constraints. INFORMS Journal on Computing, 2020, forthcoming

  • Zhang, S. Nip K., Wang Z.✉ Related machine scheduling with machine speeds satisfying linear constraints. Journal of Combinatorial Optimization, 2020, 10.1007/s10878-020-00523-1

  • Nip K.✉, Wang Z. On the Approximability of the two-phase knapsack problem. Journal of Combinatorial Optimization, 38, 1155-1179, 2019

  • He Q.✉, Zhang X., Nip K. Speed optimization over a path with heterogeneous arc costs. Transportation Research Part B: Methodological, 104, 198-214, 2017

  • Nip K., Wang Z.✉, Wang Z. Knapsack with variable weights satisfying linear constraints. Journal of Global Optimization, 69(3), 713-725, 2017

  • Wang Z.✉, Nip K. Bin packing under linear constraints. Journal of Combinatorial Optimization, 34(4), 1198-1209, 2017

  • Nip K., Wang Z.✉, Xing W. A study on several combination problems of classic shop scheduling and shortest path. Theoretical Computer Science, 654, 175-187, 2016

  • Nip K., Wang Z.✉, Wang Z. Scheduling under linear constraints. European Journal of Operational Research, 253(2), 290-297, 2016

  • Talla Nobibon, F., Leus, R.✉, Nip K., Wang, Z. Resource loading with time windows. European Journal of Operational Research, 244(2), 404-416, 2015

  • Nip K., Wang Z.✉, Talla Nobibon F., Leus R. A combination of flow shop scheduling and the shortest path problem. Journal of Combinatorial Optimization, 29(1), 36-52, 2015

(Refereed Conference Proceedings)

  • Nip K., Wang Z.✉, Shi T. Some graph optimization problems with weights satisfying linear constraints. In: Li et al. (eds.) The 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2019) , Lecture Notes in Computer Science, vol. 11949, pp. 412–424. Springer Nature Switzerland AG 2019

  • Nip K.✉, Wang Z. Two-machine flow shop scheduling problem under linear constraints. In: Li et al. (eds.) The 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2019) ,Lecture Notes in Computer Science, vol. 11949, pp. 400–411. Springer Nature Switzerland AG 2019

  • Zhang, S. Nip K.✉, Wang Z. Related machine scheduling with machine speeds satisfying linear constraints. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) The 12th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2018) , Lecture Notes in Computer Science, vol. 11346,pp. 314–328. Springer, Cham 2018

  • Nip K.✉, Wang Z. Approximation algorithms for a two-phase knapsack problem. In: Wang, L., Zhu, D. (eds.) The 24th Annual International Computing and Combinatorics Conference (COCOON 2018), Lecture Notes in Computer Science, vol. 10976, pp. 63–75. Springer International Publishing AG, part of Springer Nature 2018

  • Nip K., Wang Z.✉, 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

  • Talla Nobibon F., Leus R., Nip K., 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

  • Nip K., 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

(GoogleScholar:https://scholar.google.com/citations?user=f9KXxU0AAAAJ&hl=en; See also my homepage:https://kamengnip.wixsite.com/home)