On combinatorial properties of the knapsack problem

DOI10.1134/S0965542519080074MaRDI QIDQ2278226zbMATH OpenOpenAlexWikidataFDO

Authors 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

estimate of objective functiongenerating functionsknapsack problemNP-hard problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Generating functions in the knapsack problem
• scientific article; zbMATH DE number 3852791
• scientific article; zbMATH DE number 4160465
• scientific article; zbMATH DE number 1302173
• scientific article; zbMATH DE number 2032368

Cites work

• Generating functions in the knapsack problem
• Greedy algorithms for the minimization knapsack problem: average behavior
• scientific article; zbMATH DE number 3708409 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• On pseudo-Boolean polynomials

Cited in

(10)

• Solving the knapsack problem via \(\mathbb Z\)-transform
• Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation
• Generating functions in the knapsack problem
• On the number of solutions to a system of Boolean equations
• On the number of solutions to linear Diophantine equation and Frobenius problem
• scientific article; zbMATH DE number 2032368 (Why is no real title available?)
• Statistical mechanics of the knapsack problem
• On the Frobenius problem
• Combinatorial properties of the bounded knapsack problem
• Threshold arrangements and the knapsack problem

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

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