The paper presents an greedy algorithm with a worst-case performance ratio for the unbounded knapsack problem, an greedy algorithm with a worst-case performance ratio of for the subset-sum problem, and an greedy algorithm with a worst-case performance ratio of for the partition problem. These greedy algorithms, in the sense of worst-case performance, are better than other known greedy algorithms.
