( en | de | ru )

 

Disambiguation of "Kellerer, Hans"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Algorithms for Knapsack Problems with Cardinality Constraints

, , , and . European Journal of Operational Research, (1998)

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.

Hans Kellerer

Hans Kellerer

Helmut Kellerer

Wolfgang Kellerer

Franz Kellerer

 

Other publications of authors with the same name

The symmetric quadratic knapsack problem: approximation and scheduling applications., and . 4OR, 10 (2): 111-161 (2012)Foreword: Combinatorial optimization for industrial engineering., and . Comput. Ind. Eng., 61 (2): 239-241 (2011)Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine., , and . STOC, page 418-426. ACM, (1996)Knapsack problems with position-dependent item weights or profits., , and . Ann. Oper. Res., 326 (1): 137-156 (July 2023)An efficient fully polynomial approximation scheme for the Subset-Sum Problem., , , and . J. Comput. Syst. Sci., 66 (2): 349-370 (2003)Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system., , and . ISM, volume 180 of Procedia Computer Science, page 825-832. Elsevier, (2020)A New Fully Polynomial Approximation Scheme for the Knapsack Problem., and . APPROX, volume 1444 of Lecture Notes in Computer Science, page 123-134. Springer, (1998)The exact LPT-bound for maximizing the minimum completion time., , and . Oper. Res. Lett., 11 (5): 281-287 (1992)Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product., and . Eur. J. Oper. Res., 228 (1): 24-32 (2013)Computing the optimum stock size., , and . IPCO, page 147-159. CIACO, (1993)