A Survey of the Knapsack Problem

Haraty, Ramzi A.; Assi, Maram

A Survey of the Knapsack Problem

Haraty, Ramzi A.; Assi, Maram

URI: http://hdl.handle.net/10725/10301

URL: https://ieeexplore.ieee.org/document/8672677

DOI: https://doi.org/10.1109/ACIT.2018.8672677

Date: 2019-03-29

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

The Knapsack Problem (KP) is one of the most studied combinatorial problems. There are many variations of the problem along with many real life applications. KP seeks to select some of the available items with the maximal total weight in a way that does not exceed a given maximum limit L. Knapsack problems have been used to tackle real life problem belonging to a variety of fields including cryptography and applied mathematics. In this paper, we consider the different instances of Knapsack Problem along with its applications and various approaches to solve the problem.

Citation:

Assi, M. and Haraty, R. A. (2018). A Survey of the Knapsack Problem. In 2018 International Arab Conference on Information Technology (ACIT 2018), Werdanye, Lebanon. IEEE