knapsack problem

短语

[计] 背包问题, 渐缩问题

词形变化

knapsack problems 复数 knapsack problems

释义与例句

n.
  1. 1.

    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.