Approximating the product knapsack problem

DOI10.1007/S11590-021-01760-XMaRDI QIDQ2230782zbMATH OpenOpenAlexFDO

Authors Ulrich Pferschy, Joachim Schauer, Clemens Thielen

Publication date 28 September 2021

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-021-01760-x

zbMATH Keywords

knapsack problemapproximation schemegreedy procedure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• On the product knapsack problem
• A nonlinear knapsack problem
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
• Approximation for multi-knapsack problem
• Approximation for knapsack problems with multiple constraints

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Bi-criteria path problem with minimum length and maximum survival probability
• On the product knapsack problem

Cited in

(6)

• On different approximation criteria for subset product problems
• Approximating single- and multi-objective nonlinear sum and product knapsack problems
• Efficient reductions and algorithms for subset product
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• On the product knapsack problem

This page was built for publication: Approximating the product knapsack problem

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