The following notebooks can be used interactively to gain a better understanding of some optimization algorithms. Instructions are to be found inside the notebooks. The notebooks are written in Mathematica@4.0 and you will get the ASCII version. You may wish to pick the notebook style. You need Mathematica@4.0 (sometimes you can use a previous version) to convert the plain version into a notebook and to run it.

• Minicorso (to get familiarity with Mathematica)
• Simplex Method (revised form without upperbounds)
• Simplex Method (revised form with upperbounds)
• Column generation (three examples of column generation techniques)
• Ellipsoid Method (2-dimensional with graphics)
• Primal-dual methods (Newton's iterations of complementarity equations)
• TSP (through polyhedral combinatorics)
• TSP (through Held-Karp dual formulation)
• Stable Set (through polyhedral combinatorics)
• Euler (builds an Euler tour)
• Polyhedra (computes vertices , edges and facets of polyhedra)