动态规划算法——背包问题(Dynamic Programming Algorithm - Knapsack Problem)

最新推荐文章于 2025-03-19 08:00:20 发布

UoM_XiaoShuaiShuai

最新推荐文章于 2025-03-19 08:00:20 发布

阅读量4.6k

点赞数

分类专栏：算法文章标签：动态规划算法背包问题 java 伪代码

本文链接：https://blog.csdn.net/UoM_XiaoShuaiShuai/article/details/72900009

版权

本文介绍了背包问题的动态规划算法解决方案。通过示例解释了如何利用动态规划找到最优化的选择，以达到在不超过背包容量的情况下，选取价值最大的物品组合。并给出了算法的时间复杂度及伪代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

动态规划算法——背包问题(Dynamic Programming Algorithm - Knapsack Problem)

背包问题(Knapsack Problem)
这里写图片描述
(picture is from https://en.wikipedia.org/wiki/Knapsack_problem)
The knapsack problem is a problem in combinatorial optimisation: given n items, each with a weight and a value. Find the most valuable selection of items that will fit in the knapsack.

As shown in the picture,
knapsack capacity: 15 kg
weights: 1, 12, 2, 1, 4 kg
values: 2, 4, 2, 1, 10 dollars

If we choose the yellow, grey, blue and orange items, it will create the value of 2+2+1+10=15 dollars and has a weight of 8kg less than knapsack capacity. This is the most valuable selection.

How can we find the most valuable selection?

方法一暴力破解(Brute force)
这里写图片描述
Here is an example. We find all combinations of items and then compute its sum of weights and values.