SOME THOUGHTS ON THE 2-APPROXIMATION ALGORITHM FOR KNAPSACK PROBLEMS: A SURVEY
Relating to knapsack problems, we have herein collected those in relation to the conventional 2-approximation algorithm for the 0–1 knapsack problem. As well as the 0–1 knapsack problem, we will mention SSP, UKP, BKP, MCK, MCSSP, KPMFC, CKP, CSSP, PKP, KSP, MNK, KPC and the continuous knapsack problem.
combinatorial optimization, knapsack problem, 2-approximation algorithm.