Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2003_10_1_a3, author = {V. N. Shevchenko and D. V. Gruzdev}, title = {A modification of the {Fourier-Motskin} algorithm for constructing a triangulation}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {53--64}, publisher = {mathdoc}, volume = {10}, number = {1}, year = {2003}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2003_10_1_a3/} }
TY - JOUR AU - V. N. Shevchenko AU - D. V. Gruzdev TI - A modification of the Fourier-Motskin algorithm for constructing a triangulation JO - Diskretnyj analiz i issledovanie operacij PY - 2003 SP - 53 EP - 64 VL - 10 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2003_10_1_a3/ LA - ru ID - DA_2003_10_1_a3 ER -
%0 Journal Article %A V. N. Shevchenko %A D. V. Gruzdev %T A modification of the Fourier-Motskin algorithm for constructing a triangulation %J Diskretnyj analiz i issledovanie operacij %D 2003 %P 53-64 %V 10 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/DA_2003_10_1_a3/ %G ru %F DA_2003_10_1_a3
V. N. Shevchenko; D. V. Gruzdev. A modification of the Fourier-Motskin algorithm for constructing a triangulation. Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 1, pp. 53-64. http://geodesic.mathdoc.fr/item/DA_2003_10_1_a3/
[1] Gruzdev D. V., “Modifikatsiya algoritma Fure–Motskina dlya postroeniya triangulyatsii”, Inform. byul. Assotsiatsii matematicheskogo programmirovaniya. XII Vseros. konf. “Matematicheskoe programmirovanie i prilozheniya”, tez. dokl., no. 10, UrO RAN, Ekaterinburg, 2003, 89–90
[2] Motskin T. S., Raifa X., Tompson Dzh. L., Troll R. M., Metod dvoinogo opisaniya: Matrichnye igry, Fizmatgiz, M., 1961
[3] Pontryagin L. S., Osnovy kombinatornoi topologii, Nauka, M., 1976 | MR | Zbl
[4] Preparata F., Sheimos M., Vychislitelnaya geometriya: Vvedenie, Mir, M., 1989 | MR | Zbl
[5] Chernikov S. N., Lineinye neravenstva, Nauka, M., 1968 | MR | Zbl
[6] Shevchenko V. N., Kachestvennye voprosy tselochislennogo programmirovaniya, Fizmatlit, M., 1995 | MR | Zbl
[7] Shevchenko V. N., “O razbienii vypuklogo politopa na simpleksy bez novykh vershin”, Izv. vuzov. Matematika, 1997, no. 12, 89–99 | MR
[8] Shevchenko V. N., “O maksimalnykh triangulyatsiyakh vypuklykh politopov”, Mezhdunar. konf. “Diskretnyi analiz i issledovanie operatsii”, Materialy konf. (Novosibirsk, 26 iyunya–1 iyulya 2000), Izd-vo In-ta matematiki, Novosibirsk, 2000, 163
[9] Shevchenko V. N., Gruzdev D. V., “O minimalnom razbienii vypuklogo mnogogrannika na tetraedry”, Matematicheskoe modelirovanie i optimalnoe upravlenie, Vesti. Nizhegorodskogo un-ta, 1(18), Nizhn. Novgorod, 1998, 184–193 | Zbl
[10] Shevchenko V. N., Gruzdev D. V., “Grafovaya modifikatsiya algoritma Fure–Motskina dlya postroeniya triangulyatsii”, Gos. konf. “Diskretnyi analiz i issledovanie operatsii”, Materialy konf. (Novosibirsk, 24–28 iyunya 2002), Izd-vo In-ta matematiki, Novosibirsk, 2002, 140 | MR