On Combinatorial Properties of the Knapsack Problem-Reference-Cited by-同舟云学术

On Combinatorial Properties of the Knapsack Problem

Published:2019-08 Issue:8 Volume:59 Page:1380-1388
ISSN:0965-5425
Container-title:Computational Mathematics and Mathematical Physics
language:en
Short-container-title:Comput. Math. and Math. Phys.

Author:

Gordeev E. N.,Leont’ev V. K.

Publisher

Pleiades Publishing Ltd

Subject

Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1134/S0965542519080074.pdf

Reference7 articles.

1. V. K. Leont’ev, “Generating functions in the knapsack problem,” Proc. of the XI Int. Workshop Discrete Mathematics and Its Applications (Mosk. Gos. Univ., Moscow, 2012), pp. 415–416.

2. V. K. Leont’ev, Combinatorics and Information. Part 1. Combinatorial Analysis (Mosk. Fiz. Tekhn. Inst., Moscow, 2015) [in Russian].

3. G. P. Egorychev, Integral Representation and Calculation of Combinatorial Sums (Nauka, Novosibirsk, 1977) [in Russian].

4. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack problems (Springer, Berlin, 2004).

5. G. N. Diubin and A. A. Korbut, “Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions,” Comput. Math. Math. Phys. 48, 1521–1535 (2008).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. COMBINATORIAL PROPERTIES OF THE BOUNDED KNAPSACK PROBLEM;PRIKL DISKRETN MAT;2024

2. On the Number of Solutions to Linear Diophantine Equation and Frobenius Problem;Computational Mathematics and Mathematical Physics;2022-09

3. On the Frobenius Problem;Journal of Applied and Industrial Mathematics;2022-05

4. On the Number of Solutions to a System of Boolean Equations;Automation and Remote Control;2021-09