Geodesic
Study of the linear parametrization of criteria in the bicriteria knapsack problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 5, pp. 753-758 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1999_39_5_a4,
     author = {I. I. Melamed and I. Kh. Sigal and N. Yu. Vladimirova},
     title = {Study of the linear parametrization of criteria in the bicriteria knapsack problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {753--758},
     year = {1999},
     volume = {39},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_5_a4/}
}
TY  - JOUR
AU  - I. I. Melamed
AU  - I. Kh. Sigal
AU  - N. Yu. Vladimirova
TI  - Study of the linear parametrization of criteria in the bicriteria knapsack problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 753
EP  - 758
VL  - 39
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_5_a4/
LA  - ru
ID  - ZVMMF_1999_39_5_a4
ER  - 
%0 Journal Article
%A I. I. Melamed
%A I. Kh. Sigal
%A N. Yu. Vladimirova
%T Study of the linear parametrization of criteria in the bicriteria knapsack problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 753-758
%V 39
%N 5
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_5_a4/
%G ru
%F ZVMMF_1999_39_5_a4
I. I. Melamed; I. Kh. Sigal; N. Yu. Vladimirova. Study of the linear parametrization of criteria in the bicriteria knapsack problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 5, pp. 753-758. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_5_a4/

[1] Melamed I. I., Sigal I. Kh., “Issledovanie lineinoi svertki kriteriev v mnogokriterialnom diskretnom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 35:8 (1995), 1260–1270 | MR | Zbl

[2] Melamed I. I., Sigal I. Kh., “Vychislitelnoe issledovanie lineinoi svertki kriteriev v mnogokriterialnom diskretnom programmirovanii”, Dokl. RAN, 345:4 (1995), 463–466 | MR | Zbl

[3] Melamed I. I., Sigal I. Kh., Teoriya i algoritmy resheniya mnogokriterialnykh zadach kombinatornoi optimizatsii, VTs RAN, M., 1996

[4] Melamed I. I., Sigal I. Kh., “Vychislitelnoe issledovanie lineinoi parametrizatsii kriteriev v mnogokriterialnom diskretnom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 36:10 (1996), 23–25 | MR | Zbl

[5] Melamed I. I., Sigal I. Kh., “Issledovanie lineinoi svertki kriteriev v bikriterialnoi zadache kommivoyazhera”, Zh. vychisl. matem. i matem. fiz., 37:8 (1997), 933–936 | MR | Zbl

[6] Melamed I. I., Sigal I. Kh., Zadacha kommivoyazhera: nekotorye voprosy teorii, algoritmy, eksperimenty, VTs RAN, M., 1997

[7] Finkelshtein Yu. Yu., Priblizhennye metody i prikladnye zadachi diskretnogo programmirovaniya, Nauka, M., 1976

[8] Korbut A. A., Finkelshtein Yu. Yu., Diskretnoe programmirovanie, Nauka, M., 1969 | MR | Zbl

[9] Diubin G. N., Korbut A. A., Primal and dual greedy algorithms for the Knapsack problem: worst-case vs. Average behaviour, Rept B-121, Techn. Univ. Graz, 1997

[10] Melamed I. I., Sigal I. Kh., Vladimirova N. Yu., Nekotorye zadachi diskretnogo programmirovaniya s dvumya i tremya kriteriyami, VTs RAN, M., 1998