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

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/27568

Title:	Computational experiments for the problem of hamiltonian path with fixed number of color repetitions
Authors:	Gorbenko, A. Popov, V.
Issue Date:	2013
Citation:	Gorbenko A. Computational experiments for the problem of hamiltonian path with fixed number of color repetitions / A. Gorbenko, V. Popov // Advanced Studies in Theoretical Physics. — 2013. — Vol. 7. — № 1-4. — P. 121-126.
Abstract:	In this paper we consider an approach to solve the problem of Hamiltonian path with fixed number of color repetitions for arc-colored digraphs. Our approach is based on usage of local search algorithms to solve a logical model for the problem.
Keywords:	ARC-COLORED DIGRAPH HAMILTONIAN PATH NP-COMPLETE SATISFIABILITY PROBLEM
URI:	http://elar.urfu.ru/handle/10995/27568
SCOPUS ID:	84876346859
PURE ID:	909694
ISSN:	1313-1311
DOI:	10.12988/astp.2013.13009
Appears in Collections:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:

File	Description	Size	Format
scopus-2013-0086.pdf		71,47 kB	Adobe PDF	View/Open