BulDML at Institute of Mathematics and Informatics >
International Journal ITA >
2003 >
Volume 10 Number 3 >

Please use this identifier to cite or link to this item:

Title: An Effective Exact Algorithm for One Particular Case of the Travelling-Salesman Problem
Authors: Panishev, Anatoliy
Plechystyy, Dmytro
Keywords: Traveling-Salesman Problem
Optimal Path
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.
ISSN: 1313-0463
Appears in Collections:Volume 10 Number 3

Files in This Item:

File Description SizeFormat
ijita10-3-p20.pdf116.9 kBAdobe PDFView/Open


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


Valid XHTML 1.0!   Creative Commons License