|
BulDML at Institute of Mathematics and Informatics >
ITHEA >
International Journal ITA >
2003 >
Volume 10 Number 3 >
| 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
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
