next up previous contents
Next: Glossary Up: No Title Previous: References

References on the World Wide Web

  1. http://www.wiwi.uni-frankfurt.de/ stockhei/progs/index.html : This is a demonstration of different heuristics for the TSP 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.

  2. http://langevin.usc.edu/BST/ : Interactive animations of several types of binary search trees.

  3. http://www.aist.go.jp/NIBH/ b0616/Lab/Links.html : This page contains a list of pointers to various applets to tackle some hard problems such as the TSP. These applets implement neural nets and artificial life algorithms.

  4. http://solon.cma.univie.ac.at/ neum/glopt.html : A good site containing various optimization methods. There are also various pointers to different optimization code, etc.

  5. ftp://parcftp.xerox.com/pub/dynamics/constraints.html : This is the main site covering ``phase transitions'' in search. A number of papers can be obtained from there.

  6. http://docker.library.uwa.edu.au/matt/applets/annealing.html : An interesting SA applet with the aim of finding global extrema ... The applet shows a plot of the energy terrain 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.

  7. http://www.cs.pace.edu/ carla/graph.html : 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 java source is included.

  8. http://aleph0.clarku.edu/ djoyce/java/Geometry/Geometry.html : This applet is used to illustrate Euclid's elements. It also illustrates Euler line of a triangle. Overall, a very nice tool for showing in a clear geometric fashion Euclid's elements. Source is included.

  9. http://www.on.net/users/zhcchz/central.html : The owner of this page writes ``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.'' It is cool and source included.

  10. http://www.research.ibm.com/people/c/chaitin/lm/ : Chaitin demonstrating the limit of mathematics in this page. A java applet is included.

  11. http://www.physics.carleton.ca/courses/75.502/slides/intro/index.html : This page contains few sets of computational physics slides on chaos, monte carlo, etc.

  12. http://weber.u.washington.edu/ cvj/animalp.html : 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.

  13. http://weber.u.washington.edu/ cvj/tsp/tspnew.html : From the page ``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 ...

  14. http://www.dk-online.dk/users/hagerup/java/tstdk.htm : Another TSP applet (nice) with source code ...

  15. http://www.cs.utah.edu/ bbachman/gtutor/ : A general graphics tutorial ... Teaching how to do graphics in general. (nice)

  16. http://www-courses.cs.uiuc.edu:80/ c-medina/mp1/ : 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.

  17. http://alumni.caltech.edu:80/ ingber/ : SA archive for papers and code of Ingber's work.

  18. http://www.taygeta.com/annealing/simanneal.html : Simulated annealing references and software packages written in C and C++.

  19. http://www.maths.uq.oz.au/ ch/bookmarks.html : A nice collection of optimization and operation research links.

  20. http://www.maths.mu.oz.au/ worms/digest/digest.html : A nice digest that contain a list of relavent operation research topics.

  21. http://www.st.rim.or.jp/ kanada/combinatorial.html : Containing some quite useful pointers including one to our work from 2 years ago :-)

  22. http://www.thep.lu.se/tf2/complex/article.complex.html : A list of publications for Peterson's Potts model.

  23. http://www.isor.vuw.ac.nz/ grant/Tabu.html : A short and informative description of Tabu Search.

  24. http://rtm.science.unitn.it/ : Battiti's reactive Tabu Search stuff.

  25. ttp://www.isor.vuw.ac.nz/ grant/research1.html : 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 .

  26. http://fi-www.arc.nasa.gov/fia/projects/xfr/papers/benchmark-article.html : Scheduling Benchmarks and Related Resources.

  27. http://www.mcs.anl.gov/home/otc/otc.html : Homepage of the optimization tech. center at Argonne.

  28. http://ucsu.colorado.edu/ xu/software.html : From the page ``This list is a collection of codes for optimization and related fields. Most codes are in public domain and can be retrieved via anonymous ftp. The collection concentrates on codes in network optimization, graph theory and other combinatorial optimization problems.''

  29. http://www-math.cudenver.edu/ hgreenbe/glossary/glossary.html : This contains terms specific to mathematical programming, and some terms from other disciplines, notably mathematics, that are directly related.

  30. http://www.ing.unlp.edu.ar/cetad/mos/ : A very extensive collection of software, approaches, and algorithms on the TSP. (very nice)

  31. http://lancet.mit.edu/galib-2.4/ : GAlib is a set of C++ genetic algorithm objects. The library includes tools for using genetic algorithms to do optimization in any C++ program.

  32. http://www.pronex.com/atsp/download.html : A coolection of TSP software, documents, and test problems.

  33. http://www.research.ibm.com/osl/osl : This page is for IBM optimization subroutine library (OSL).

  34. ftp://orion.uwaterloo.ca/pub/henry/software/readme.html : Software, papers, and background, related to the research of Wolkowicz is available in fortran and/or matlab.

  35. http://pespmc1.vub.ac.be/ASC/OPTIMIZATIO.html : PRINCIPIA CYBERNETICA WEB: contains a good collection of optimization resources.

  36. http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/english/scripts.html : A collection of papers, surveys, and lecture notes .... (slow connection).

  37. http://www.cs.purdue.edu/homes/cmh/electrobook/intro.html : An Electronic Primer on Geometric Constraint Solving: Theoretical Foundations and implementation Issues.

  38. http://www.ics.uci.edu/ eppstein/gina/constraint.html : Geometry in Action: Constraint Solving - part of the computational geometry work.

  39. http://gams.nist.gov/ : Guide to Available Mathematical Software.

  40. http://dmawww.epfl.ch/ rochat//orms.html : Lots of stuff about operations research.

  41. http://cfatab.harvard.edu/nr/nronline.html : Those numerical recipes (C and Fortran) books are online.

  42. http://www.ics.uci.edu/ eppstein/161/glossary.html : A very nice glossary related to design and analysis of various optimization algorithms.

  43. ftp://parcftp.xerox.com/pub/dynamics/multiagent.html The page of dynamic computation group at Xeros Parc. Has lots of pointers to optimization related issues.

  44. http://www.imada.ou.dk/Research/graphcol.html : Graph coloring archives ...

  45. http://mat.gsia.cmu.edu/ : The main page of operation research.



next up previous contents
Next: Glossary Up: No Title Previous: References



HPF demo web account
Mon Nov 18 19:45:42 EST 1996