knapsack problem

基本解释

with the continuous knapsack problem as we've formulated it, greedy is good.
因为正如我们已经归越过的,对于一般连续性背包问题贪婪算法很实用。
So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
让我们开始仔细讲讲一个问题，那就是背包问题。
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背包问题。

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背包问题。
麻省理工公开课 - 计算机科学及编程导论课程节选

背包问题
Thirdly, ACO algorithms for solving the strongly NP-hard knapsack problem werestudied.
再次,研究了ACO求解强NP难的背包问题。
经济学
背包问题
By making use of simulated annealing algorithm with memory, and determining a set of effective cooling schedule, the thesis solves this complex and special knapsack problem successfully.
本文应用带记忆功能的模拟退火算法，结合理论分析和经验法则，通过大量试验确定了一组有效的冷却进度表参数，成功地解决了这个复杂而特殊的背包问题。
数学
渐缩问题