Kameng Nip

According to our database1, Kameng Nip authored at least 15 papers between 2013 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints.
INFORMS J. Comput., 2021

2019
On the approximability of the two-phase knapsack problem.
J. Comb. Optim., 2019

Some Graph Optimization Problems with Weights Satisfying Linear Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2019

Two-Machine Flow Shop Scheduling Problem Under Linear Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Approximation Algorithms for a Two-Phase Knapsack Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Related Machine Scheduling with Machine Speeds Satisfying Linear Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Knapsack with variable weights satisfying linear constraints.
J. Glob. Optim., 2017

Bin packing under linear constraints.
J. Comb. Optim., 2017

Assortment Optimization under a Single Transition Model.
CoRR, 2017

2016
A study on several combination problems of classic shop scheduling and shortest path.
Theor. Comput. Sci., 2016

Scheduling under linear constraints.
Eur. J. Oper. Res., 2016

2015
A combination of flow shop scheduling and the shortest path problem.
J. Comb. Optim., 2015

Resource loading with time windows.
Eur. J. Oper. Res., 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
Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013


  Loading...