TThe classical problem of finding a Hamiltonian path in a graph is considered for the case when the length of the edges are set inaccurately. The solution of the problem is proposed for the following account of uncertainty: the elements of the matrix are random variables with known density distribution; the value of the elements are defined by the expectation and variance; elements of the matrix are determined on the assumption of worst-density distribution of the random utility values for which the probability of hitting the random utility in the invalid range reaches the maximum.
incomplete count, the Hamilton’s path lengths of the edges are set inaccurately, genetic algorithm
"Otыskanye hamyltonova puty na nepolnodostupnom stokhastycheskom hrafe" [Determination of Hamiltonian path on the incomplete stochastic column],
Information Processing Systems,