14 search results - page 1 / 3» Using Hopfield Networks to Solve Traveling Salesman Problems... |

IJCNN

2000

IEEE

13 years 8 months ago
2000

IEEE

In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...

IJON

2008

13 years 4 months ago
2008

In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...

NCA

2008

IEEE

13 years 4 months ago
2008

IEEE

The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...

IPPS

1998

IEEE

13 years 8 months ago
1998

IEEE

Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...

SODA

2010

ACM

14 years 1 months ago
2010

ACM

The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...