工作经历

教育情况

主要访问经历

运筹学: 组合优化, 算法设计与分析, 及其在管理科学、排序调度、交通运输等的应用问题

收益管理: 选品优化, 定价, 消费者离散选择模型, 竞争博弈

欢迎对运筹优化研究感兴趣, 特别是有数理、计算机算法背景的同学联系!

近几年发表文章

• Xiao H., Gong M., Lian Z., Nip K. Promotional effort and assortment optimization under with the multinomial logit model, Naval Research Logistics, 71:941–959, 2024

• Nip K., Wang C. Duopoly assortment competition under the multinomial logit model: simultaneous vs. sequential. In: the Twenty-Fifth ACM Conference on Economics and Computation (EC’24).

• Jiang S., Nip K. An enhanced conic reformulation for capacity-constrained assortment optimization under the mixture of multinomial logit model. Journal of the Operations Research Society of China, 12(3): 757-771, 2024

• Nip K., Xie P. Computational complexity and algorithms for two scheduling problems under linear constraints, Journal of Combinatorial Optimization, 47:55, 2024

• Nip K.. On the NP-hardness of two scheduling problems under linear constraints. In: M. Li et al. (eds.) IJTCS—FAW 2023, Lecture Notes in Computer Science, vol. 13933, pp. 58– 70. Springer, Switzerland AG, 2023。

• Nip K., Wang Z. A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints. Journal of Scheduling, 26, 543–558, 2023.

• Nip K., Wang C., Wang Z. Competitive and cooperative product assortment games under Markov chain choice model. Production and Operations Management, 31(3), 1033–1051, 2022 (UTD24)

• Zhang, S. Nip K., Wang Z. Related machine scheduling with machine speeds satisfying linear constraints. Journal of Combinatorial Optimization, 44, 1724– 1740, 2022

• Nip K., Shi T., Wang Z. Some graph optimization problems with weights satisfying linear constraints. Journal of Combinatorial Optimization, 43, 200-225, 2022

• Nip K., Wang Z., Wang Z. Assortment optimization under a single transition choice model. Production and Operations Management, 30(7), 2122-2142, 2021 (UTD24)

• Wu Z., Nip K., He Q. A new combinatorial algorithm for separable convex resource allocation with nested bound constraints. INFORMS Journal on Computing, 33(3), 1197-1212 , 2021 (UTD24)

• Nip K., Wang Z. On the approximability of the two-phase knapsack problem. Journal of Combinatorial Optimization, 38(4), 1155-1179, 2019

For more details on my research, please visit https://kamengnip.github.io/

课题项目

▷ 若干线性约束下的车间排序问题的算法研究，福建省自然科学基金青创项目， 2021-2024， 主持

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

▷ 线性约束下的组合优化问题研究，国家自然科学基金， 2018-2022，参与

▷凸二次约束二次规划问题的鲁棒灵敏度分析研究，国家自然科学基金， 2018-2022，参与

▷ 组合优化问题的组合：问题、算法和复杂性，国家自然科学基金， 2014-2017，参与

▷ Complexity results and exact algorithms for scheduling conflicting jobs on alternative resources, Bilateral Scientific Cooperation between Tsinghua University - K.U. Leuven. 2011-2013, 参与

指导研究生

• 谢朋（厦门大学，硕士，2022-2025, 优秀硕士论文）

• 温楷文（厦门大学，硕士，2023-）

教学经历

学会任职

中国运筹学会排序分会青年理事

匿名审稿人

▷ The 20th Conference on Web and Internet Economics(WINE) 2024

▷ OR Spectrum

▷ Optimization Letter

▷ Journal of Combinatorial Optimization

▷ Journal of the Operations Research Society of China  

▷ Journal of Global Optimization  

▷ Manufacturing & Service Operations Management(MSOM)

▷ Theoretical Computer Science

▷ INFORMS Conference on Service Science 2022

▷ Concurrency and Computation: Practice and Experience

▷ Journal of Computer and System Sciences

▷ Computers and Operations Research

▷ Algorithmica

▷ INFORMS Journal on Optimization