Nearest neighbour algorithm TSP minimization, lower bound estimation, optimal length interval identification, symmetric matrix distances, classroom network optimization

Dijkstra’s algorithm shortest path, route inspection Chinese Postman, network weight 193, inspection route with open/closed trail, Eulerian graph conditions

Bin packing first-fit vs first-fit decreasing, bubble sort first pass analysis, quick sort with pivot identification, descending list ordering, minimum bin count optimization

Activity network precedence, early/late event time calculation, critical path identification, total float, scheduling diagram optimization, worker lower bound from total activity duration

Graph vertex order contradiction, path verification on network, Prim’s algorithm MST step-by-step, MST drawing on fixed vertices, updated edge constraint interval for uniqueness