AM-73 - Greedy heuristics

You are currently viewing an archived version of Topic . If updates or revisions have been published you can find them at .

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)