Hamilton Traveling-Salesman Problem Minimal Cost Route Assignment Problem Cyclic Expansion Algorithms
Institute of Information Theories and Applications FOI ITHEA
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.