This header plots the critical line of the Riemann Zeta Function.  A complete understanding wins a $1,000,000 prize.
. . .
Main   Links   Orders   Post   Next Page   Next + 10

Computer Methods

The Traveling Salesman problem is an excellent introduction to mathematical methods in computer programs.  Numerical Recipes in C explains this problem quite well ... so well, it helped inspire this site.  Two good sites for TSP are the following:

R Grothmann has an EXCELLENT java applet for TSP that is very fast, and fascinating to watch.  His site comes complete with source code... very nice!

Torsten Reil has a different applet for the same problem.  It's slower, but you can also see more of what is happening, giving you a good feeling for how simulated annealing works.

Pablo Moscato has put together a definitive homepage for the Traveling Salesman problem.  Very nice.

A list of useful Optimization Software provides code for TSP and many other related functions.

Java Applets.  Jars offers excellent example programs.

I plan to expand this site with my own analysis of simulated annealing.  If you have any good programs which exploit this or other methods, please write me.