中英互译
knapsack problem
基本释义
- 背包问题：一种组合优化的NP完全问题，描述了在限定总重量内如何选择物品以使得总价值最大化的问题。
双语例句
- 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背包问题的求解，阐明这种方法求解问题的过程。
网络短语
- The Knapsack Problem背包问题
- Unbounded Knapsack Problem背包问题
- 0-1 knapsack problem背包问题
- Multidimensional Knapsack Problem多维背包问题
- fractional knapsack problem分数背包问题
英英释义
- 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.