Integer knapsack problems with profit functions of the same value range

DOI10.1007/s10288-022-00514-4zbMath1522.90155MaRDI QIDQ6054010

Mikhail Y. Kovalyov, Dmitry I. Kopelevich, Sergey Kovalev, Evgeny E. Gurevsky

Publication date: 24 October 2023

Published in: 4OR (Search for Journal in Brave)

zbMATH Keywords

convex optimizationknapsack problemNP-hardnessFPTASmedian finding

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the general nonlinear separable knapsack problem
• Time bounds for selection
• The nonlinear knapsack problem - algorithms and applications
• Integer optimization with penalized fractional values: the knapsack case
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• Improving the complexities of approximation algorithms for optimization problems
• Approximation issues of fractional knapsack with penalties: a note
• An FPTAS for the knapsack problem with parametric weights
• An Algorithm for Large Zero-One Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Combinatorial Problems: Reductibility and Approximation
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• Discrete-Variable Extremum Problems
• Min‐sum controllable risk problems with concave risk functions of the same value range

This page was built for publication: Integer knapsack problems with profit functions of the same value range