Abstract
The knapsack problem with Boolean variables and a single constraint is considered. Combinatorial formulas for calculating and estimating the cardinality of the set of feasible solutions and the values of the functional in various cases depending on given parameters of the problem are derived. The coefficients of the objective function and of the constraint vector and the knapsack size are used as parameters. The baseline technique is the classical method of generating functions. The results obtained can be used to estimate the complexity of enumeration and decomposition methods for solving the problem and can also be used as auxiliary procedures in developing such methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. K. Leont’ev, “Generating functions in the knapsack problem,” in Proceedings of the 11th International Seminar on Discrete Mathematics and Applications (Mosk. Gos. Univ., Moscow, 2012), pp. 415–416.
V. K. Leont’ev, Combinatorics and Information, Part 1: Combinatorial Analysis (Mosk. Fiz.-Tekh. Inst., Moscow, 2015) [in Russian].
G. P. Egorychev, Integral Representation in the Computation of Combinatorial Sums (Nauka, Novosibirsk, 1977) [in Russian].
H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems (Springer, Berlin, 2004).
G. N. Diubin and A. A. Korbut, Comput. Math. Math. Phys. 48 (9), 1521–1535 (2008).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.K. Leontiev, E.N. Gordeev, 2018, published in Doklady Akademii Nauk, 2018, Vol. 481, No. 5.
Rights and permissions
About this article
Cite this article
Leontiev, V.K., Gordeev, E.N. Generating Functions in the Knapsack Problem. Dokl. Math. 98, 364–366 (2018). https://doi.org/10.1134/S1064562418050198
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562418050198