Geodesic
The linear convolution of criteria in the bicriteria traveling salesman problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 8, pp. 933-936 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1997_37_8_a4,
     author = {I. I. Melamed and I. Kh. Sigal},
     title = {The linear convolution of criteria in the bicriteria traveling salesman problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {933--936},
     year = {1997},
     volume = {37},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_8_a4/}
}
TY  - JOUR
AU  - I. I. Melamed
AU  - I. Kh. Sigal
TI  - The linear convolution of criteria in the bicriteria traveling salesman problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1997
SP  - 933
EP  - 936
VL  - 37
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_8_a4/
LA  - ru
ID  - ZVMMF_1997_37_8_a4
ER  - 
%0 Journal Article
%A I. I. Melamed
%A I. Kh. Sigal
%T The linear convolution of criteria in the bicriteria traveling salesman problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1997
%P 933-936
%V 37
%N 8
%U http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_8_a4/
%G ru
%F ZVMMF_1997_37_8_a4
I. I. Melamed; I. Kh. Sigal. The linear convolution of criteria in the bicriteria traveling salesman problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 8, pp. 933-936. http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_8_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] Sigal I. Kh., “Vychislitelnaya realizatsiya kombinirovannogo algoritma vetvei i granits dlya zadachi kommivoyazhera”, Zh. vychisl. matem. i matem. fiz., 26:5 (1986), 664–672 | MR | Zbl

[4] Sigal I. Kh., “Dekompozitsionnyi podkhod k resheniyu zadachi kommivoyazhera bolshoi razmernosti i nekotorye ego prilozheniya”, Izv. AN SSSR. Tekhn. kibernetika, 1990, no. 6, 143–155 | MR | Zbl

[5] Sigal I. Kh., “Algoritm priblizhennogo resheniya zadachi kommivoyazhera bolshoi razmernosti i ego vychislitelnaya realizatsiya”, Zh. vychisl. matem. i matem. fiz., 27:8 (1987), 1145–1153 | MR | Zbl

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

[7] Korbut A. A., Sigal I. Kh., Finkelshtein Yu. Yu., “Ob effektivnosti kombinatornykh algoritmov v diskretnom programmirovanii”, Sovrem. sostoyanie teorii issl. operatsii, Nauka, M., 1979, 283–310