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, AnatoliyPlechystyy, Dmytro Keywords: Traveling-Salesman ProblemOptimizationOptimal PathPermutations 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 SizeFormat