On combinatorial properties of the knapsack problem

DOI10.1134/S0965542519080074zbMath1425.90093OpenAlexW2975001484WikidataQ127197220 ScholiaQ127197220MaRDI QIDQ2278226

Eh. N. Gordeev, V. K. Leont'ev

Publication date: 4 December 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542519080074

zbMATH Keywords

generating functionsknapsack problemNP-hard problemsestimate of objective function

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Unnamed Item ⋮ On the number of solutions to a system of Boolean equations ⋮ On the number of solutions to linear Diophantine equation and Frobenius problem

Cites Work

• Unnamed Item
• Unnamed Item
• On pseudo-Boolean polynomials
• Greedy algorithms for the minimization knapsack problem: average behavior
• Generating functions in the knapsack problem

This page was built for publication: On combinatorial properties of the knapsack problem