1. G. Dantzig, Linear Programming, its Applications, and Generalizations (Progress, Moscow, 1966) [in Russian].
2. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems (Springer, Berlin, 2004).
3. M. R. Garey and D. S. Johnson, Computers and Intractability: The Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
4. I. I. Kh. Sigal and A. P. Ivanova, Introduction to Applied Discrete Programming: Models and Computational Algorithms, 2nd ed. (FIZMATLIT, Moscow, 2007) [in Russian].
5. G. N. Dyubin and A. A. Korbut, “Greedy Algorithms for the Knapsack Problem: Average Behavior,” Sib. Zh. Industr. Mat. 2(2(4)), 68–93 (1999).