1. Nearest Neighbour Algorithm—upper bound distance calculation for traveling between multiple points.
2. Kruskal’s Algorithm—finding the minimum spanning tree for a given network, edge consideration order.
3. Early Event Times and Late Event Times—determining float values in project scheduling, drawing cascade charts.
4. Bin Packing Algorithms—first-fit and first-fit decreasing methods for optimizing space, quick sort for sorting items.
5. Eulerian and Hamiltonian Circuits—optimization of travel routes through graph traversal, shortest path determination.
6. Linear Programming—formulation of optimization problems, constraints, objective line method for finding the optimal solution.