Kameng Nip
Orcid: 0000-0002-8597-3295
According to our database1,
Kameng Nip
authored at least 18 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Computational complexity and algorithms for two scheduling problems under linear constraints.
J. Comb. Optim., May, 2024
2023
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints.
J. Sched., December, 2023
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023
2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
2021
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints.
INFORMS J. Comput., 2021
2019
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
2017
2016
A study on several combination problems of classic shop scheduling and shortest path.
Theor. Comput. Sci., 2016
2015
J. Comb. Optim., 2015
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013