| The Modules | |
| . | About modules |
Dynamic Programming | |
| Die Hard at the Pub | |
| Towers of Hanoi | |
| new Towers of Hanoi | |
| Shortest Path Problem | |
| Dijkstra's Algorithm | |
| Knapsack Problem | |
| New Knapsack Problem | |
| Critical Path Method | |
| Chained Matrices | |
| Replacement | |
| Bridge & Torch | |
| Dropping Eggs | |
| False Coin Problem | |
| Traveling Salesman Problem | |
Integer Programming | |
| Branch and Bound (Knapsack) | |
| Gomory Cuts | |
| Royal Optimization | |
| New Royal Optimization | |
| 8 Easy Pieces | |
Linear Algebra | |
| Row Operations | |
| The Equator | |
| The Inverter | |
| Determinants | |
Linear Programming | |
| The Simplex Place | |
| Virtual Duality | |
Simulation | |
| M/M/1 Queues | |
| G/G/s Queues | |
| Queueing Networks | |
| Random Generator Tester | |
Other | |
| Geee Park | |