| Speed optimization over a path with heterogeneous arc costs Q He, X Zhang, K Nip Transportation Research Part B: Methodological 104, 198-214, 2017 | 51 | 2017 |
| A combination of flow shop scheduling and the shortest path problem K Nip, Z Wang, F Talla Nobibon, R Leus Journal of Combinatorial Optimization 29, 36-52, 2015 | 21 | 2015 |
| A study on several combination problems of classic shop scheduling and shortest path K Nip, Z Wang, W Xing Theoretical Computer Science 654, 175-187, 2016 | 17 | 2016 |
| Scheduling under linear constraints K Nip, Z Wang, Z Wang European Journal of Operational Research 253 (2), 290-297, 2016 | 13 | 2016 |
| Resource loading with time windows FT Nobibon, R Leus, K Nip, Z Wang European Journal of Operational Research 244 (2), 404-416, 2015 | 13 | 2015 |
| Knapsack with variable weights satisfying linear constraints K Nip, Z Wang, Z Wang Journal of Global Optimization 69, 713-725, 2017 | 11 | 2017 |
| Related machine scheduling with machine speeds satisfying linear constraints S Zhang, K Nip, Z Wang Journal of Combinatorial Optimization 44 (3), 1724-1740, 2022 | 9 | 2022 |
| Assortment optimization under a single transition model K Nip, Z Wang, Z Wang arXiv preprint arXiv:1702.03700, 2017 | 9 | 2017 |
| Assortment optimization under a single transition choice model K Nip, Z Wang, Z Wang Production and Operations Management 30 (7), 2122-2142, 2021 | 8 | 2021 |
| Bin packing under linear constraints Z Wang, K Nip Journal of Combinatorial Optimization 34, 1198-1209, 2017 | 7 | 2017 |
| Combination of two-machine flow shop scheduling and shortest path problems K Nip, Z Wang Computing and Combinatorics: 19th International Conference, COCOON 2013 …, 2013 | 7 | 2013 |
| Some graph optimization problems with weights satisfying linear constraints K Nip, T Shi, Z Wang Journal of Combinatorial Optimization 43 (1), 200-225, 2022 | 6 | 2022 |
| Competitive and Cooperative Assortment Games under Markov Chain Choice Model K Nip, C Wang, Z Wang Production and Operations Management, 2020 | 6 | 2020 |
| A new combinatorial algorithm for separable convex resource allocation with nested bound constraints Z Wu, K Nip, Q He INFORMS Journal on Computing 33 (3), 1197-1212, 2021 | 4 | 2021 |
| Two-machine flow shop scheduling problem under linear constraints K Nip, Z Wang Combinatorial Optimization and Applications: 13th International Conference …, 2019 | 4 | 2019 |
| Approximation Algorithms for a Two-Phase Knapsack Problem K Nip, Z Wang International Computing and Combinatorics Conference, 63-75, 2018 | 4 | 2018 |
| On the approximability of the two-phase knapsack problem K Nip, Z Wang Journal of Combinatorial Optimization 38 (4), 1155-1179, 2019 | 3 | 2019 |
| Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms K Nip, Z Wang, W Xing International Computing and Combinatorics Conference, 97-108, 2015 | 3 | 2015 |
| A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints K Nip, Z Wang Journal of Scheduling, 1-16, 2021 | 2 | 2021 |
| Resource loading: Applications and complexity analysis FT Nobibon, R Leus, K Nip, Z Wang 11th International Symposium on Operations Research and its Applications in …, 2013 | 2 | 2013 |
