Let's now go back and instantiate these ideas for the knapsack problem we looked at last time in particular, for the 0-1 knapsack problem.

让我们回来用具体例子，来说明我们上次看过的背包问题，特别是对0 - 1背包问题来说。

youdao

The idea of rank two relaxation for max-cut problem is used to quadratic knapsack problem, and the model of the rank two relaxation for quadratic knapsack problem is obtained.

把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。

youdao

The precise and approximate algorithms solving 0-1 knapsack problem, precise algorithm could not be used to solve 0-1 knapsack problem in a short time, so it could not be applied extensively.

求解0 - 1背包问题的精确算法不能在较短时间内求解大规模0 - 1背包问题，使其实用性受到限制。

youdao

So I haven't done magic, I've given you a really fast way to solve a knapsack problem, but it's still exponential deep down in its heart, in something.

所以我并没有施魔法，我已经告诉了你,一种快速解决背包问题的方法了,但是某些方面它的核心仍然是指数增长的。

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

Let's now go back and instantiate these ideas for the knapsack problem we looked at last time In particular, for the 0-1 knapsack problem.

让我们回来用具体例子,来说明我们上次看过的背包问题,特别是对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.

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

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