Engelbrecht-Wiggans, Richard - Cowles Foundation for Research in Economics, Yale University - 1977
The greedy heuristic may be used to obtain approximate solutions to integer programming problems. For some classes of problems, notably knapsack problems related to the coin changing problem, the greedy heuristic results in optimal solutions. However, the greedy heuristic does quite poorly at...