Discrete optimization

V. K. Leont'ev

Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 47 (2007) no. 2, pp. 338-352

Résumé

A survey of some theoretical concepts in discrete optimization is given.

Bibliographie

[1] Grötschel M., Lovaz L., Combinatorial optimization. Handbook of Combinatorics, North-Holland, 1994

[2] Nemhauser G. L., Wolsey L. A., Integer and combinatorial optimization, John Wiley and Sons, New York, 1988 | MR

[3] Sapozhenko A. A., Asratyan A. C., Kuzyurin H. H., “Obzor nekotorykh rezultatov po zadacham o pokrytii”, Metody diskretnogo analiza v reshenii kombinatornykh zadach, 30, Novosibirsk, 1977, 46–75 | Zbl

[4] Shevchenko V. N., Kachestvennye voprosy tselochislennogo programmirovaniya, Nauka, M., 1995 | MR | Zbl

[5] Beresnev V. L., Gimadi E. Kh., Dementev V. T., Ekstremalnye zadachi standartizatsii, Nauka, Novosibirsk, 1978 | MR

[6] Feiesh Tot L., Raspolozheniya na ploskosti, na sfere i v prostranstve, Fizmatgiz, M., 1958

[7] Leontev V. K., Gordeev E. N., “Kachestvennoe issledovanie traektornykh zadach”, Kibernetika, 1986, no. 5, 82–90 | MR

[8] Papadimitriu X., Staiglits K., Kombinatornaya optimizatsiya, Mir, M., 1985 | MR

[9] Leontev V. K., “Diskretnye ekstremalnye zadachi”, Itogi nauki i tekhn., 16, VINITI, M., 1979, 39–101

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

[11] Zhuravlëv Yu. I., Izbrannye trudy, Magistr, M., 1998

[12] Yudin D. B., Goryashko A. P., Nemirovskii A. C., Matematicheskie metody optimizatsii ustroistv i algoritmov ASU, Radio i svyaz, M., 1982 | MR | Zbl

[13] Kuk S., “Slozhnost protsedur vyvoda”, Kibernetich. sb., 12, Mir, M., 1975, 149–174

[14] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[15] Leontev V. K., Tarastsov O. G., “O tochnosti zadaniya vkhodnykh dannykh v traektornykh zadachakh”, Zh. vychisl. matem. i matem. fiz., 33:9 (1993), 1260–1264 | MR

[16] Sergienko I. V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii, Nauk. dumka, Kiev, 1985 | MR

[17] Levin V. I., Intervalnaya diskretnaya optimizatsiya, Probl. teor. kibernetiki, M., 1996

[18] Gimadi E. Kh., Glebov N. I., Perepelitsa B. A., “Algoritmy s otsenkami dlya zadach diskretnoi optimizatsii”, Prikl. kibernetika, 31, 1976, 35–42 | MR | Zbl

[19] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera”, Avtomatika i telemekhan., 1989, no. 9, 41–73 | MR

[20] Emelichev V. A., Kovalev M. M., Kravtsov M. K., Mnogogranniki, grafy, optimizatsiya, Nauka, M., 1981 | MR

[21] Reingold E., Nivergelt T., Deo N., Kombinatornye algoritmy, Mir, M., 1980 | MR | Zbl

[22] Bellman R., Dinamicheskoe programmirovanie, Izd-vo inostr. lit., M., 1960 | MR

[23] Mikhalevich B. C., Sergienko I. V., Shor N. Z., “Issledovanie metodov resheniya optimizatsionnykh zadach i ikh prilozheniya”, Kibernetika, 1981, no. 4, 89–113 | MR | Zbl

[24] Kovalev M. M., Matroidy v diskretnoi optimizatsii, Izd-vo Belarus. un-ta, Minsk, 1987 | MR | Zbl

[25] Skhreiver A., Teoriya lineinogo i tselochislennogo programmirovaniya, v. 1, 2, Mir, M., 1991

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

[27] Bakhvalov N. S., “Ob optimalnosti lineinykh metodov priblizheniya operatorov na vypuklykh klassakh funktsii”, Zh. vychisl. matem. i matem. fiz., 11:4 (1971), 1014–1018 | Zbl

[28] Vitushkin A. G., Otsenka slozhnosti zadachi tabulirovaniya, Fizmatgiz, M., 1959

[29] Traub Dzh., Vasilkovskii G., Vozhnyakovskii X., Informatsiya, neopredelennost, slozhnost, Mir, M., 1988 | MR | Zbl

[30] Gordeev E. N., Leontev V. K., “Ob otsenkakh slozhnosti tabulirovaniya traektornykh zadach”, Zh. vychisl. matem. i matem. fiz., 25:8 (1985), 1272–1275 | MR | Zbl

[31] Uzdemir A. P., Dinamicheskie tselochislennye zadachi optimizatsii v ekonomike, Nauka, M., 1995 | MR | Zbl