网络释义专业释义英英释义
The Knapsack Problem 背包问题
Unbounded Knapsack Problem 背包问题
0-1 knapsack problem 背包问题
Multidimensional Knapsack Problem 多维背包问题
fractional knapsack problem 分数背包问题
Knapsack Problem Algorithm 背包问题算法实现
-
背包问题 - 引用次数：150
Thirdly, ACO algorithms for solving the strongly NP-hard knapsack problem werestudied.
再次,研究了ACO求解强NP难的背包问题。
参考来源 - 蚁群优化方法中若干问题研究 -
背包问题 - 引用次数：17
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.
本文应用带记忆功能的模拟退火算法，结合理论分析和经验法则，通过大量试验确定了一组有效的冷却进度表参数，成功地解决了这个复杂而特殊的背包问题。
参考来源 - 基于模拟退火算法的贷款组合优化研究 -
渐缩问题
-
背包问题
·2,447,543篇论文数据，部分数据来源于NoteExpress
Knapsack problem
- abstract: The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
以上来源于: WordNet
双语例句原声例句
-
This is about 01 knapsack problem dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
-
With the continuous knapsack problem as we've formulated it, greedy is good.
因为正如我们已经归越过的，对于一般连续性背包问题贪婪算法很实用。
-
The solution process is described with the solution of 0/1 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背包问题。
应用推荐