Method of Finding Hamilton Routes in Transport Network
| Data(s) |
14/04/2010
14/04/2010
2008
|
|---|---|
| Resumo |
This article discusses a solution method for Hamilton Problem, which either finds the task's solution, or indicates that the task is unsolvable. Offered method has significantly smaller requirements for computing resources than known algorithms. |
| Identificador |
1313-0455 |
| Idioma(s) |
en |
| Publicador |
Institute of Information Theories and Applications FOI ITHEA |
| Palavras-Chave | #Hamilton Traveling-Salesman Problem #Minimal Cost Route #Assignment Problem #Cyclic Expansion #Algorithms |
| Tipo |
Article |
