KNAPSACK PROBLEMS: A COMPREHENSIVE REVIEW

BARAKAT, DOAA EL-SHAHAT and EL-HENAWY, IBRAHIM MAHMOUD and ABDEL-BASSET, MOHAMMED (2016) KNAPSACK PROBLEMS: A COMPREHENSIVE REVIEW. Asian Journal of Mathematics and Computer Research, 14 (4). pp. 296-317.

Full text not available from this repository.

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.

Item Type: Article
Subjects: Eprints AP open Archive > Mathematical Science
Depositing User: Unnamed user with email admin@eprints.apopenarchive.com
Date Deposited: 27 Dec 2023 07:05
Last Modified: 27 Dec 2023 07:05
URI: http://asian.go4sending.com/id/eprint/1839

Actions (login required)

View Item
View Item