Huang Yu-lin
Abstract
The question of 0/1 knapsack is solved through dynamic planning,but part of such a problem can be solved by greedy algorithm.Explaining the differences and similarities of the above two methods,the article aims to elaborate the conditions where the question of 0/1 knapsack can be solved by greedy algorithm.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The question of 0/1 knapsack is solved through dynamic planning,but part of such a problem can be solved by greedy algorithm.Explaining the differences and similarities of the above two methods,the article aims to elaborate the conditions where the question of 0/1 knapsack can be solved by greedy algorithm.
Key concepts: Knapsack problem, Continuous knapsack problem, Greedy algorithm, Change-making problem, Mathematical optimization, Polynomial-time approximation scheme, Mathematics, Greedy randomized adaptive search procedure