You can also find my articles on my Google Scholar or DBLP profile.
Published in: Xiao H., Gong M., Lian Z., Nip K. Joint promotional effort and assortment optimization under the multinomial logit model. Naval Research Logistics, 71:941–959, 2024
Published in: Nip K., Xie P. Computational complexity and algorithms for two scheduling problems under linear constraints. Journal of Combinatorial Optimization, 47:55, 2024
Published in: 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
Published in: Nip K., Wang C., Wang Z. Competitive and cooperative product assortment problems under Markov chain choice model. Production and Operations Management, 31(3), 1033–1051, 2022
Published in: Zhang, S., Nip K., Wang Z. Related machine scheduling with machine speeds satisfying linear constraints. Journal of Combinatorial Optimization, 44, 1724–1740, 2022
Published in: Nip K., Shi T., Wang Z. Some graph optimization problems with weights satisfying linear constraints. Journal of Combinatorial Optimization, 43:200-225, 2022
Published in: 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
Published in: Nip K., Wang Z., Wang Z. Assortment optimization problem under a single transition model. Production and Operations Management, 30(7), 2122-2142, 2021
Published in: 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
Published in: Nip K., Wang Z. On the approximability of the two-phase knapsack problem. Journal of Combinatorial Optimization, 38, 1155-1179, 2019
Published in: He Q., Zhang X., Nip K. Speed optimization over a path with heterogeneous arc costs. Transportation Research Part B: Methodological, 104, 198-214, 2017
Published in: Nip K., Wang Z., Wang Z. Knapsack with variable weights satisfying linear constraints. Journal of Global Optimization, 69(3), 713-725, 2017
Published in: Wang Z., Nip K.. Bin packing under linear constraints. Journal of Combinatorial Optimization, 34(4), 1198-1209, 2017
Published in: 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
Published in: Nip K., Wang, Z., Wang Z. Scheduling under linear constraints. European Journal of Operational Research, 253(2), 290-297, 2016
Published in: Talla Nobibon, F., Leus, R., Nip K., Wang C., Wang, Z. Resource loading with time windows. European Journal of Operational Research, 244(2), 404-416, 2015
Published in: 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
Published in: 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 (EC24), 2024
Published in: 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, 2023
Published in: 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
Published in: 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
Published in: 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
Published in: 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
Published in: 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
Published in: 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
Published in: 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
Guan L., Nip K., Zhang L., Wang, R. The Focal Multinomial Logit Model: Threshold effects on consumer choice, assortment, pricing and estimation, under Major revision in the Manufacturing & Service Operations Management (MSOM), 2023. SSRN available.