#### Title

Using Concurrent Programming method to Solve the Traveling Salesman Problem
#### Overview

This project will focus on how to use concurrent programming methods to solve
the Traveling Salesman Problem, which has been proved to be NP-complete.
#### Papers

N. Toomarian.
A Concurrent Neural Network Algorithm for the Travel Salesman
Problem.
In *Proceedings of the third conference on Hypercube concurrent computers
and applications*. Pasadena, 1998. ACM.
#### Additional reading material

Wilhelm Hasselering.
Programming Languages and Systems for Prototyping Concurrent Applications
*ACM Computing Surveys*, 32(1):43-79, March 2000.
#### Implementation details