AM-73 - Greedy heuristics

Learning Objectives: 
  • Demonstrate how to implement a greedy heuristic process
  • Identify problems for which the greedy heuristic also produces the optimal solution (e.g., Kruskal’s algorithm for minimum spanning tree, the fractional Knapsack problem)

Keywords: