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] 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