Chinese 背包问题 Cited by user 金色黎明 on 05 May 2022 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为:给定一组物品,每种物品都有自己的重量和价格,在限定的总重量内,我们如何选择,才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中,背包的空间有限,但我们需要最大化背包内所装物品的价值。背包问题通常出现在资源分配中,决策者必须分…
English Subset sum problem Cited by user Erel Segal on 01 Jun 2021 The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset
English Algorithm Cited by user KolbertBot on 28 Aug 2017 In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.