Linear convex graphs and some route game problems
Vestnik Chelyabinskogo Gosudarstvennogo Universiteta. Matematika, Mekhanika, Informatika, no. 16 (2013), pp. 21-33
Cet article a éte moissonné depuis la source Math-Net.Ru
A generalization by means of the linear norm for the notion of convex set is considered in the paper. The concept is transferred to finite graphs. Properties of such graphs are studied by means of resolution of the open Traveling Salesman Problem and some route games in the conflict condition on them.
Keywords:
convex set, linear norm, Hamiltonian circuit, Traveling Salesman Problem, zero-sum game.
Mots-clés : quasiconvex function
Mots-clés : quasiconvex function
@article{VCHGU_2013_16_a1,
author = {E. G. Belov},
title = {Linear convex graphs and some route game problems},
journal = {Vestnik Chelyabinskogo Gosudarstvennogo Universiteta. Matematika, Mekhanika, Informatika},
pages = {21--33},
year = {2013},
number = {16},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VCHGU_2013_16_a1/}
}
E. G. Belov. Linear convex graphs and some route game problems. Vestnik Chelyabinskogo Gosudarstvennogo Universiteta. Matematika, Mekhanika, Informatika, no. 16 (2013), pp. 21-33. http://geodesic.mathdoc.fr/item/VCHGU_2013_16_a1/
[1] N. Kristofides, Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978, 432 pp. | MR