( en | de | ru )

 

Disambiguation of "Nip, Kameng"

Author of the publication

copydeleteadd this publication to your clipboard
Resource loading with time windows.

, , , and . Eur. J. Oper. Res., 244 (2): 404-416 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peter Nippus

Elisabeth Nipshagen

Heinz Nippesen

Max Nippold

Kurt Nippes

 

Other publications of authors with the same name

A Combination of Flow Shop Scheduling and the Shortest Path Problem., , , and . CoRR, (2013)Scheduling under linear constraints., , and . Eur. J. Oper. Res., 253 (2): 290-297 (2016)On the NP-Hardness of Two Scheduling Problems Under Linear Constraints.. IJTCS-FAW, volume 13933 of Lecture Notes in Computer Science, page 58-70. Springer, (2023)Bin packing under linear constraints., and . J. Comb. Optim., 34 (4): 1198-1209 (2017)Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems., and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 680-687. Springer, (2013)A combination of flow shop scheduling and the shortest path problem., , , and . J. Comb. Optim., 29 (1): 36-52 (2015)Related machine scheduling with machine speeds satisfying linear constraints., , and . J. Comb. Optim., 44 (3): 1724-1740 (2022)Approximation Algorithms for a Two-Phase Knapsack Problem., and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 63-75. Springer, (2018)Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 97-108. Springer, (2015)On the approximability of the two-phase knapsack problem., and . J. Comb. Optim., 38 (4): 1155-1179 (2019)