Shanglu He
Abstract
This paper presents a greedy algorithm for knapsack problem,discusses it with supermodular set function,and proves the performance guarantee of the algorithm.In the end,this paper uses this algorithm to solve a knapsack problem.
OpenAlex reports 2 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.
This paper presents a greedy algorithm for knapsack problem,discusses it with supermodular set function,and proves the performance guarantee of the algorithm.In the end,this paper uses this algorithm to solve a knapsack problem.
Key concepts: Knapsack problem, Continuous knapsack problem, Greedy algorithm, Change-making problem, Mathematical optimization, Generalized assignment problem, Cutting stock problem, Set (abstract data type)