Polyhedron combinatorial properties associated with the shortest path problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 9, pp. 1693-1696
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZVMMF_2004_44_9_a13,
author = {A. N. Maksimenko},
title = {Polyhedron combinatorial properties associated with the shortest path problem},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1693--1696},
year = {2004},
volume = {44},
number = {9},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_9_a13/}
}
TY - JOUR AU - A. N. Maksimenko TI - Polyhedron combinatorial properties associated with the shortest path problem JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2004 SP - 1693 EP - 1696 VL - 44 IS - 9 UR - http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_9_a13/ LA - ru ID - ZVMMF_2004_44_9_a13 ER -
A. N. Maksimenko. Polyhedron combinatorial properties associated with the shortest path problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 9, pp. 1693-1696. http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_9_a13/
[1] Papadimitriu Kh., Staiglits K., Kombinatornaya optimizatsiya: Algoritmy i slozhnost, Mir, M., 1985 | MR
[2] Kristofides N., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978 | MR
[3] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR
[4] Emelichev V. A., Kovalev M. M., Kravtsov M. K., Mnogogranniki, grafy, optimizatsiya, Nauka, M., 1981 | MR
[5] Bondarenko V. A., Poliedralnye grafy i slozhnost v kombinatornoi optimizatsii, YarGU, Yaroslavl, 1995
[6] Leontev V. K., “Diskretnye ekstremalnye zadachi”, Itogi nauki i tekhn., 31, VINITI, M., 1979