KNAPSACK PROBLEMS: A COMPREHENSIVE REVIEW
DOAA EL-SHAHAT BARAKAT
Department of Computer Science, Zagazig University, Egypt
IBRAHIM MAHMOUD EL-HENAWY
Department of Computer Science, Zagazig University, Egypt
MOHAMMED ABDEL-BASSET *
Department of Decision Support, Zagazig University, Egypt
*Author to whom correspondence should be addressed.
Abstract
An intensive study of the knapsack problem is provided as it proves its effectiveness and success within the computer science field. The knapsack problem (KP) is NP-hard problem and finding the optimal solution to the larger one in practice is impossible. This paper provides a focused literature review of the Knapsack problem. In addition; it discusses distinct variations of KP, investigates its numerous applications in several areas, and presents different algorithms for solving the knapsack problems.
Keywords: Knapsack problem, combinatorial optimization, metaheuristic, discretization, hybridization, nature-inspired algorithm