BulDML at Institute of Mathematics and Informatics: An Effective Exact Algorithm for One Particular Case of the Travelling-Salesman Problem

	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 Journal ITA >
2003 >
Volume 10 Number 3 >

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

Title:	An Effective Exact Algorithm for One Particular Case of the Travelling-Salesman Problem
Authors:	Panishev, Anatoliy Plechystyy, Dmytro
Keywords:	Traveling-Salesman Problem Optimization Optimal Path Permutations
Issue Date:	2003
Publisher:	Institute of Information Theories and Applications FOI ITHEA
Abstract:	The article presents the exact algorithm for solving one case of the job-scheduling problem for the case when the source matrix is ordered by rows.
URI:	http://hdl.handle.net/10525/962
ISSN:	1313-0463
Appears in Collections:	Volume 10 Number 3

Files in This Item:

File	Description	Size	Format
ijita10-3-p20.pdf		116.9 kB	Adobe PDF	View/Open

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

Creative Commons License