Combinatorial properties of the bounded knapsack problem

DOI10.17223/20710410/63/8MaRDI QIDQ6495991zbMATH OpenFDO

Authors M. S. A. Volkov

Publication date 2 May 2024

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17223/20710410/63/8

zbMATH Keywords

coefficient methoddecomposition methodsdeductiongenerating functionsknapsack problemNP-complete problems

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Recommendations

• On combinatorial properties of the knapsack problem
• Generating functions in the knapsack problem
• scientific article; zbMATH DE number 3852791
• Average saving effects in enumerative methods for solving knapsack problems
• scientific article; zbMATH DE number 4139486

This page was built for publication: Combinatorial properties of the bounded knapsack problem

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