GC4-1 - Greedy heuristics

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

Author and Citation Info: 

DiBiase, D., DeMers, M., Johnson, A., Kemp, K., Luck, A. T., Plewe, B., and Wentz, E. (2006). Greedy heuristics. The Geographic Information Science & Technology Body of Knowledge. Washington, DC: Association of American Geographers. (2nd Quarter 2016, first digital).

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)