This is the main homepage of Saleh Elmohamed. It contains various pointers for work in Perl, CGI and Java. Also it contains links to work in progress, etc. ....
This page lists conferences and workshops on and related to operations research ....
An Interesting list of bookmarks including some good ones for Java links, etc. ....
It contains some pretty good tools and applets (optimization applets, and others ...)
The applet uses what is referred to as the cooperative simulated annealing method (COSA) which a populational extension of Simulated Annealing, meant to find good solutions for large combinatorial optimization problems. Source is included.
This is a demonstration of different heuristics for tour planning. Choices are: (1) 2opt ... Optimize by a simple two Corner exchange. (2) 3opt ... Optimize by exchanging three Corners. (3) OR_opt ... A restricted 3opt algorithm. (4) Nearest ... Find the nearest free neighbour. (5) Reset ... Repaints the last unchanged tour. (6) New ... Generates a new Tour.
Interactive animations of several types of binary search trees.
A nice animated Java applet for several types of binary trees.
This page (in Japan) contains a list of pointers various applets to tackle some hard problems such as the TSP. These applets implement neural nets and artificial life algorithms to solve these problems ....
A good site containing various optimization methods. There are also various pointers to various optimization code, etc.
This the page (Xerox group) where phase transitions in search are covered. A number of papers can be obtained from there.
An interesting SA applet with the aim of finding global extrema ... The applet (from a site in Australia) shows a plot of the energy tarain where the max or min is shown. The plot has a set of parameter control bottons for setting the parameters, etc. No source is included there.
It describes Dijkstra's well known algorithm to determine the shortest paths in a graph from a given startpoint to any other point. The Dijkstra shortest path algorithm is decribed in many books, such as Intro to Algorithms by CLR. The applet (written by someone at Pace Univ) is interesting; it gives the user lots of control over the location of the nodes and the weights between them. Also allow drawing the nodes and the connections, etc. Each step in the algorithm is explained with a short text shown in a special text area, etc. The source is included.
This another interesting geometry applet written by someone at Clark Univ. It used to illustrate Euclid's elements. Another example of it illustrate Euler line of a triangle. Overall, a very nice tool for showing in a clear geometric fashion Euclid's elements. Source is included.
The impression most people have after their first statistics course is that all distributions of random phenomena in the universe are of the Normal/Gaussian variety. While there are plenty of others around, the Normal curve explains a remarkable range of biological measurements such as the heights of adult humans. The Quincunx is a device which allows a bead to drop through an array of pins stuck in a board. Source code is included.
A nice page by Gregory Chaitin demonstrating the limit of math. Java applet is included.
This site at Carleton Univ contains few sets of computational physics slides, e.g chaos, monte carlo, etc.
Anima-LP allows one to enter constraints using a spread-sheet-like interface and see the corresponding graphical representation. Coefficients, right-hand side values can all be changed using the spreadsheet like interface. The java version doesn't come with source code, only classes. (uw)
This is a demonstration of different heuristics for tour planning. Options are 2-opt, 3-opt, r-opt, etc. No code or documentation included with this applet.
The Euclidean traveling salesman problem can be stated as follows: Given n cities located in the plane, find the shortest route that visits all the cities exactly once and returns to the starting city. For the Euclidean Traveling Salesman Problem, we consider the question of how the optimal solution changes when a city is moved. Of course, cities do not move, so this particular problem may be moot. Given the extensive research on the traveling salesman problem, results developed for it may be applicable to other combinatorial optimization problems. The problem forms one of the canonical problems in the field of combinatorial optimization. Many new algorithmic techniques first saw application to the traveling salesman problem. Hundreds of heuristics have been developed that can produce good, but not necessarily optimal routes. No source is included with applets ...
TSP using Kohonen neural nets .... There are other applets of similar type there. Source code is included. (Switzerland)
A nice TSP applet with source code ... (Denmark)
A general graphics tutorial ... Teaching how to do graphics in general. (Utah)
Round-Robin Scheduling in Java: A nice scheduling applet with some explanations such as: (1) What is Round-Robin Scheduling? (2) Round-Robin Analysis (3) How the simulation is implemented (4) The display (5) The source code (6) The Round-Robin Simulation. (UIUC)
Voronoi Diagram / Delaunay Triangulation: a nice applet for computational geometry ... (Cornell)
SA archive for papers and code of Ingber's work. (Caltech)
Simulated annealing references and software packages written in C and C++. The page maintained by Skip Carter (California).
A nice collection of optimization and operation research links. (Austarlia).
A useful hot links to various pages and work at CSIRO (Austarlia)
A nice digest that contain a list of relavent operation research topics.
A list of publications for Peterson's Potts model.
A short and informative description of Tabu Search. (New Zeland)
This page contains a useful summary of various heuristic algorithms as well as pointers to: 1. Local Search 2. Simulated Annealing 3. Genetic Algorithms 4. Threshold Accepting Methods (i.e. the Great Deluge Algorithm et al.) 5. Tabu Search .