An Effective Exact Algorithm for One Particular Case of the Travelling-Salesman Problem
| Data(s) |
08/01/2010
08/01/2010
2003
|
|---|---|
| Resumo |
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. |
| Identificador |
1313-0463 |
| Idioma(s) |
en |
| Publicador |
Institute of Information Theories and Applications FOI ITHEA |
| Palavras-Chave | #Traveling-Salesman Problem #Optimization #Optimal Path #Permutations |
| Tipo |
Article |
