with the continuous knapsack problem as we've formulated it, greedy is good.

因为正如我们已经归越过的,对于一般连续性背包问题贪婪算法很实用。

麻省理工公开课 - 计算机科学及编程导论课程节选

So he's packing and unpacking, packing and unpacking, trying all possible combinations of objects that will obey the constraint. And then choosing the winner. Well, this is like an algorithm we've seen before. It's not greedy.

因此它不断装包和清包,尝试了所有满足约束条件的物品组合,最后选择最优者,这很像我们以前看过的一个算法,这不是贪婪算法。

麻省理工公开课 - 计算机科学及编程导论课程节选