Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Software » comp.soft-sys.math.mathematica

Topic: Re: [mg5087] Mathematica Programming for Combinatorial Problems
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Alessandro Rossi

Posts: 1
Registered: 12/11/04
Re: [mg5087] Mathematica Programming for Combinatorial Problems
Posted: Dec 1, 1996 11:19 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Andrea Riciputi (ariciputi@mbox.queen.it) wrote:
: In article <556oeo$nac@dragonfly.wolfram.com>, "Paul R. Wellin"
: <wellin@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@mbox.queen.it










Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.