%0 Journal Article
%T Computational experiments for the problem of Hamiltonian path with fixed number of color repetitions
%A A. Gorbenko
%A V. Popov
%J Advanced Studies in Theoretical Physics
%D 2013
%I 
%X In this paper we consider an approach to solve the problem of Hamiltonianpath with fixed number of color repetitions for arc-colored digraphs.Our approach is based on usage of local search algorithms tosolve a logical model for the problem.
%K Hamiltonian path
%K arc-colored digraph
%K satisfiability problem
%K NP-complete
%U http://www.m-hikari.com/astp/astp2013/astp1-4-2013/popovASTP1-4-2013-1.pdf