knapsack problem

基本解釋

with the continuous knapsack problem as we've formulated it, greedy is good.
因?yàn)檎缥覀円呀?jīng)歸越過的,對(duì)于一般連續(xù)性背包問題貪婪算法很實(shí)用。
So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
讓我們開始仔細(xì)講講一個(gè)問題，那就是背包問題。
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.
所以我并沒有施魔法，我已經(jīng)告訴了你,一種快速解決背包問題的方法了,但是某些方面它的核心仍然是指數(shù)增長的。
麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
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.
讓我們回來用具體例子,來說明我們上次看過的背包問題,特別是對(duì)0-1背包問題來說。
麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
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背包問題。
麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選

背包問題
Thirdly, ACO algorithms for solving the strongly NP-hard knapsack problem werestudied.
再次,研究了ACO求解強(qiáng)NP難的背包問題。
經(jīng)濟(jì)學(xué)
背包問題
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.
本文應(yīng)用帶記憶功能的模擬退火算法，結(jié)合理論分析和經(jīng)驗(yàn)法則，通過大量試驗(yàn)確定了一組有效的冷卻進(jìn)度表參數(shù)，成功地解決了這個(gè)復(fù)雜而特殊的背包問題。
數(shù)學(xué)
漸縮問題