1. Papadimitriou, C.H. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity,
Englewood Cliffs, N.J.: Prentice-Hall, 1982. Translated under the title: Kombinatornaya optimizatsiya, Moscow:
Mir, 1989.
2. Garey, M. and Johnson, D., Computers and
Intractability, San Francisco : W. H. Freeman, 1979. Translated under the title:
Vychislitel’nye mashiny i trudnoreshaemye zadachi,
Moscow: Mir, 1982.
3. Schrijver, A., Theory of Linear and Integer
Programming, Chichester: John Wiley & Sons, 1986. Translated under the title:
Teoriya lineinogo i tselochislennogo programmirovaniya,
Moscow: Mir, 1991.
4. Leontiev, V.K. and Gordeev, E.N., Generating functions in the knapsack
problem, Dokl. Math., 2018, vol. 98, pp. 364–366.
https://doi.org/10.1134/S1064562418050198
5. Gordeev, E.N. and Leont’ev, V.K., On combinatorial properties of the
knapsack problem, Comput. Math. Math. Phys., 2019,
vol. 59, no. 8, pp. 1380–1388.
https://doi.org/10.1134/S0965542519080074