BulDML at Institute of Mathematics and Informatics: Method of Finding Hamilton Routes in Transport Network

	Home

Browse
	Communities & Collections
	Issue Date
	Author
	Title
	Subject

Sign on to:
	Receive email updates
	My DSpace authorized users
	Edit Profile


	About DSpace

BulDML at Institute of Mathematics and Informatics >
ITHEA >
International Book Series Information Science and Computing >
2008 >
Book 7 Artificial Intelligence and Decision Making >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/1151

Title:	Method of Finding Hamilton Routes in Transport Network
Authors:	Garashchenko, Irina Panishev, Anatoliy
Keywords:	Hamilton Traveling-Salesman Problem Minimal Cost Route Assignment Problem Cyclic Expansion Algorithms
Issue Date:	2008
Publisher:	Institute of Information Theories and Applications FOI ITHEA
Abstract:	This article discusses a solution method for Hamilton Problem, which either finds the task's solution, or indicates that the task is unsolvable. Offered method has significantly smaller requirements for computing resources than known algorithms.
URI:	http://hdl.handle.net/10525/1151
ISSN:	1313-0455
Appears in Collections:	Book 7 Artificial Intelligence and Decision Making

Files in This Item:

File	Description	Size	Format
IBS-07-p05.pdf		125.36 kB	Adobe PDF	View/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Creative Commons License