Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches (original) (raw)

Computers & Operations Research, 2000

Abstract

Unlike its cousin, the Euclidean Traveling Salesman Problem (TSP), to the best of our knowledge, there has been no documented all-neural solution to the Euclidean Hamiltonian Path Problem (HPP). The reason for this is the fact that the heuristics which map the cities onto the neurons “lose their credibility” because the underlying cyclic property of the order of the neurons

Kuban Altinel hasn't uploaded this paper.

Let Kuban know you want this paper to be uploaded.

Ask for this paper to be uploaded.