Re: Mathematica Programming for Combinatorial Problems
- To: mathgroup at smc.vnet.net
- Subject: [mg5356] Re: [mg5087] Mathematica Programming for Combinatorial Problems
- From: rossiale at vega.unive.it (Alessandro Rossi)
- Date: Thu, 5 Dec 1996 14:50:08 -0500
- Organization: Universita' Ca' Foscari Venezia - CICSD
- Sender: owner-wri-mathgroup at wolfram.com
Andrea Riciputi (ariciputi at mbox.queen.it) wrote: : In article <556oeo$nac at dragonfly.wolfram.com>, "Paul R. Wellin" : <wellin at wolfram.com> 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: ariciputi at mbox.queen.it