Author of the publication

Approximating single- and multi-objective nonlinear sum and product knapsack problems.

, , and . Discret. Optim., 48 (Part 1): 100771 (May 2023)

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

The Product Knapsack Problem: Approximation and Complexity., , and . CoRR, (2019)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , , , and . Theor. Comput. Sci., (2020)Approximation Methods for Multiobjective Optimization Problems: A Survey., , and . INFORMS J. Comput., 33 (4): 1284-1299 (2021)An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems., , , and . CoRR, (2021)The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems., , , and . Theory Comput. Syst., 66 (1): 395-415 (2022)An FPTAS for a General Class of Parametric Optimization Problems., , , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 25-37. Springer, (2019)Approximating single- and multi-objective nonlinear sum and product knapsack problems., , and . Discret. Optim., 48 (Part 1): 100771 (May 2023)An approximation algorithm for a general class of multi-parametric optimization problems., , , and . J. Comb. Optim., 44 (3): 1459-1494 (2022)Special issue on: Computational discrete optimization., and . EURO J. Comput. Optim., 8 (3): 201-203 (2020)Complexity of the Temporal Shortest Path Interdiction Problem., , and . SAND, volume 257 of LIPIcs, page 9:1-9:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)