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., 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] Gribov A. B., “Rekursivnoe reshenie transportnykh zadach lineinogo programmirovaniya”, Vestn. LGU, 1978, no. 4(19), 11–19 | Zbl
[6] Preparata R., Sheimos M., Vychislitelnaya geometriya: Vvedenie, Mir, M., 1989 | Zbl
[7] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, M., 1982