Integer knapsack problems with profit functions of the same value range

DOI10.1007/S10288-022-00514-4MaRDI QIDQ6054010zbMATH OpenFDO

Authors Evgeny Gurevsky, Dmitry I. Kopelevich, Sergey Kovalev, M. Y. Kovalyov

Publication date 24 October 2023

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10288-022-00514-4

zbMATH Keywords

convex optimizationFPTASknapsack problemmedian findingNP-hardness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4202023
• Integer knapsack problems with set-up weights
• Knapsack problems with position-dependent item weights or profits
• Integrality gaps of integer knapsack problems
• Integer quadratic knapsack problems
• Feasibility of integer knapsacks
• A total-value greedy heuristic for the integer knapsack problem
• On equivalent knapsack problems
• scientific article; zbMATH DE number 4031399
• 0-1 knapsack problems

Cites work

• An Algorithm for Large Zero-One Knapsack Problems
• An FPTAS for the knapsack problem with parametric weights
• Approximation issues of fractional knapsack with penalties: a note
• Combinatorial Problems: Reductibility and Approximation
• Discrete-variable extremum problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Heuristic algorithms for the general nonlinear separable knapsack problem
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Improving the complexities of approximation algorithms for optimization problems
• Integer optimization with penalized fractional values: the knapsack case
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• The nonlinear knapsack problem - algorithms and applications
• Time bounds for selection

Cited in

(5)

• On the product knapsack problem
• How to pack your items when you have to buy your knapsack
• Knapsack problems with position-dependent item weights or profits
• Expressing and visualizing model uncertainty in Bayesian variable selection using Cartesian credible sets
• Solving knapsack problems with \(S\)-curve return functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6054010)