全部 标题 作者
关键词 摘要


Computational experiments for the problem of Hamiltonian path with fixed number of color repetitions

Keywords: Hamiltonian path , arc-colored digraph , satisfiability problem , NP-complete

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

comments powered by Disqus