Author of the publication

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.

 

Other publications of authors with the same name

Exact solution of the robust knapsack problem., , and . Computers & OR, 40 (11): 2625-2631 (2013)The Core Concept for the Multidimensional Knapsack Problem., , and . EvoCOP, volume 3906 of Lecture Notes in Computer Science, page 195-208. Springer, (2006)The Shortest Path Game: Complexity and Algorithms., , and . IFIP TCS, volume 8705 of Lecture Notes in Computer Science, page 39-53. Springer, (2014)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)On the Robust Knapsack Problem., and . CTW, page 207-210. (2011)Competitive multi-agent scheduling with an iterative selection rule., , and . 4OR, 16 (1): 15-29 (2018)Geometric and LP-based heuristics for the quadratic travelling salesman problem., , , and . CoRR, (2018)The Shortest Connection Game., , and . CoRR, (2015)Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem., , and . CoRR, (2017)Integer optimization with penalized fractional values: The Knapsack case., , , and . European Journal of Operational Research, 273 (3): 874-888 (2019)