Geodesic
Numerical analysis of algorithms for solving bicriteria discrete programming problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 11, pp. 1602-1610 
I. I. Melamed; I. Kh. Sigal. Numerical analysis of algorithms for solving bicriteria discrete programming problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 11, pp. 1602-1610. http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_11_a3/
@article{ZVMMF_2000_40_11_a3,
     author = {I. I. Melamed and I. Kh. Sigal},
     title = {Numerical analysis of algorithms for solving bicriteria discrete programming problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1602--1610},
     year = {2000},
     volume = {40},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_11_a3/}
}
TY  - JOUR
AU  - I. I. Melamed
AU  - I. Kh. Sigal
TI  - Numerical analysis of algorithms for solving bicriteria discrete programming problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2000
SP  - 1602
EP  - 1610
VL  - 40
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_11_a3/
LA  - ru
ID  - ZVMMF_2000_40_11_a3
ER  - 
%0 Journal Article
%A I. I. Melamed
%A I. Kh. Sigal
%T Numerical analysis of algorithms for solving bicriteria discrete programming problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2000
%P 1602-1610
%V 40
%N 11
%U http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_11_a3/
%G ru
%F ZVMMF_2000_40_11_a3

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

[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., “Vychislitelnoe issledovanie lineinoi parametrizatsii kriteriev v mnogokriterialnom diskretnom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 36:10 (1996), 23–25 | MR | Zbl

[4] Melamed I. I., “Teoriya lineinoi parametrizatsii kriteriev v mnogokriterialnoi optimizatsii”, Dokl. RAN, 348:4 (1996), 446–448 | 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., “Vychislitelnoe issledovanie trekhkriterialnykh zadach o derevyakh i naznacheniyakh”, Zh. vychisl. matem. i matem. fiz., 38:10 (1998), 1780–1787 | MR | Zbl

[7] Melamed I. I., Sigal I. Kh., Vladimirova N. Yu., “Issledovanie lineinoi svertki kriteriev v bikriterialnoi zadache o rantse”, Zh. vychisl. matem. i matem. fiz., 39:5 (1999), 753–758 | MR | Zbl

[8] Melamed I. I., Sigal I. Kh., “Zadachi kombinatornoi optimizatsii s dvumya i tremya kriteriyami”, Dokl. RAN, 366:2 (1999), 170–173 | MR | Zbl

[9] Melamed I. I., “Multicriteria combmatorial optimization. Theory and algorithms”, ECCO VI (Bruxelles, 1993), 72

[10] Melamed I. I., Sigal I. Kh., Bikriterialnye zadachi diskretnogo programmirovaniya s MINSUM-MINSUM kriteriyami, VTs RAN, M., 2000