knapsack problem
名词 n.
英文释义
名词 n.
- A problem in combinatorial optimization: given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
词形变化
0 次浏览
数据来源: Wiktionary