Andrea Riciputi (firstname.lastname@example.org) wrote: : In article <email@example.com>, "Paul R. Wellin" : <firstname.lastname@example.org> wrote:
: > > Does anyone know of a reference book that addresses Mathematica programming : > > in relation to specific combinatorial problems such as the Travelling : > Salesman Problem, etc.? : > : > Probably your best bet would be Steven Skiena's book, "Implementing : > Discrete Mathematics: Combinatorics and Graph Theory with : > Mathematica" [Addison-Wesley 1991]. It includes an entire chapter : > on algorithmic graph theory and has specific material on traveling : > salesman tours. All of the functions defined in the book are actually : > included in each copy of Mathematica in the directory : > Packages:DiscreteMath:Combinatorica.m.
: You could try on "Simulating Neural Networks with Mathematica". It's a : different way to solve the problem. The code for solving the TSP in that book with Hopfield network architecture is full of mistakes : -- : Andrea Riciputi : E-mail: email@example.com