与传统的背包算法不同的是，该算法适合于多维目标优化。

Being different from the traditional Knapsack algorithm, KFA is for multiple-objective optimization.

youdao

但是让我们找一找它的一些变种，在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。

But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.

youdao

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

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

youdao

But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.

但是让我们找一找它的一些变种，在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。

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

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

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

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