tutORial Project
In early 2000 the IFORS Educational Resources Committee launched a special project called tutORial. Its mission was to initiate a long term international collaborative effort aiming to develop a comprehensive collection of web-based tutorial modules for OR/MS topics.
The Project was completed at the end of 2007. Its web site (http://www.ifors.ms.unimelb.edu.au/tutorial) provides more than 30 modules covering a wide range of subjects. The complete list of topics is as follows (some topics have more than one module):
Dynamic Programming: Integer Programming:
- Die Hard at the Pub
- Towers of Hanoi
- Shortest Path Problem
- Dijkstra's Algorithm
- Knapsack Problem
- Critical Path Method
- Chained Matrix Product
- Replacement Problem
- Bridge and Torch
- Dropping Eggs
- False Coin Problem
- Traveling Salesman Problem
- Branch and Bound (Knapsack)
- Gomory Cuts
- Royal Optimization
- New Royal Optimization
- 8 Easy Pieces
Linear Algebra: Linear Programming:
- Row Operations
- The Equator
- The Inverter
- Determinants
Simulation:
- The Simplex Place
- Virtual Duality
- Dual Simplex Method
- Transportation Simplex Algorithm
- Hungarian Algorithm
- M/M/1 Queues
- G/G/s Queues
- Queueing Networks
- Random Generator Tester
Other:
- Geee Park
