Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MAIS_2007_14_2_a1, author = {B. V. Uryvaev}, title = {On relaxation polytope of 3-satisfiability problem}, journal = {Modelirovanie i analiz informacionnyh sistem}, pages = {7--11}, publisher = {mathdoc}, volume = {14}, number = {2}, year = {2007}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MAIS_2007_14_2_a1/} }
B. V. Uryvaev. On relaxation polytope of 3-satisfiability problem. Modelirovanie i analiz informacionnyh sistem, Tome 14 (2007) no. 2, pp. 7-11. http://geodesic.mathdoc.fr/item/MAIS_2007_14_2_a1/
[1] V. A. Bondarenko, Poliedralnye grafy i slozhnost v kombinatornoi optimizatsii, Yarosl. gos. un-t, Yaroslavl, 1995, 126 pp.
[2] M. M. Deza, M. Loran, Geometriya razrezov i metrik, per. E. Panteleevoi i P. Sergeeva; pod red. V. Grishukhina, MTsNMO, M., 2001, 736 pp.
[3] M. Geri, D. Dzhonson, Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982, 416 pp. | MR
[4] V. A. Emelichev, M. M. Kovalev, M. K. Kravtsov, Mnogogranniki, grafy, optimizatsiya, Nauka, M., 1981, 344 pp. | MR
[5] A. P. Ilichev, V. N. Shevchenko, “O krainikh tochkakh mnogogrannikov mnogoindeksnykh transportnykh zadach”, Kombinatorno-algebraicheskie metody v prikladnoi matematike, Izd-vo GGU, Gorkii, 1981, 66–72 | MR
[6] S. E. Borisov, R. V. Filipov, “O netselochislennykh vershinakh trekhindeksnykh transportnykh mnogogrannikov”, Sovremennye problemy matematiki i informatiki, Sbornik nauchnykh trudov molodykh uchenykh, aspirantov i studentov, 2, Yarosl. gos. un-t, Yaroslavl, 1999, 153–156