Geodesic
On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a~restriction on the cardinality
Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 2, pp. 56-73.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2006_13_2_a4,
     author = {A. Yu. Chirkov and V. N. Shevchenko},
     title = {On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a~restriction on the cardinality},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {56--73},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2006_13_2_a4/}
}
TY  - JOUR
AU  - A. Yu. Chirkov
AU  - V. N. Shevchenko
TI  - On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a~restriction on the cardinality
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2006
SP  - 56
EP  - 73
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2006_13_2_a4/
LA  - ru
ID  - DA_2006_13_2_a4
ER  - 
%0 Journal Article
%A A. Yu. Chirkov
%A V. N. Shevchenko
%T On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a~restriction on the cardinality
%J Diskretnyj analiz i issledovanie operacij
%D 2006
%P 56-73
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2006_13_2_a4/
%G ru
%F DA_2006_13_2_a4
A. Yu. Chirkov; V. N. Shevchenko. On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a~restriction on the cardinality. Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 2, pp. 56-73. http://geodesic.mathdoc.fr/item/DA_2006_13_2_a4/

[1] Skhreiver A., Teoriya lineinogo tselochislennogo programmirovaniya, t. 1, per. s angl., Mir, M., 1991

[2] Chirkov A. Yu., “O $(n-1)$-mernom priblizhennom reshenii $n$-mernoi zadachi o ryukzake”, Problemy teoreticheskoi kibernetiki, Tezisy dokladov XIV Mezhdunarodnoi konferentsii (Penza, 23–28 maya 2005 g.), Izd-vo mekhaniko-matematicheskogo fakulteta MGU, M., 2005, 173

[3] Shevchenko V. N., Kachestvennye voprosy tselochislennogo programmirovaniya, Fizmatlit, M., 1995

[4] Shevchenko V. N., Chirkov A. Yu., “Tochnost priblizhennogo resheniya zadachi o ryukzake”, Materialy XIV Mezhdunarodnoi shkoly-seminara «Sintez i slozhnost upravlyayuschikh sistem» (Nizhnii Novgorod, 27 oktyabrya–1 noyabrya 2003 g.), Izd-vo Nizhegorodskogo gosudarstvennogo pedagogicheskogo universiteta, Nizhnii Novgorod, 2003, 114–117

[5] Shevchenko V. N., Chirkov A. Yu., “Tochnost priblizhennogo resheniya zadachi o ryukzake”, Materialy 8 mezhdunarodnogo seminara «Diskretnaya matematika i ee prilozheniya» (Moskva, 2–6 fevralya 2004 g.), Izd-vo MGU, M., 2004, 114

[6] Caprara A., Kellerer H., Pferschy U., Pisinger D., “Approximation algorithms for knapsack problems with cardinality constraints”, European J. Oper. Res., 123:2 (2000), 333–345 | DOI | MR | Zbl

[7] Kohli R., Krishnamurti R., “A total-value greedy heuristic for the integer knapsack problem”, Oper. Res. Lett., 12:2 (1992), 65–71 | DOI | MR | Zbl

[8] Kohli R., Krishnamurti R., “Joint performance of greedy heuristics for the integer knapsack problem”, Discrete Appl. Math., 56:1 (1995), 37–48 | DOI | MR | Zbl