A Survey of the Knapsack Problem

A Survey of the Knapsack Problem

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 p...

Full description

Saved in:
Bibliographic Details
Main Author: Haraty, Ramzi A. (author)
Other Authors: Assi, Maram (author)
Format: conferenceObject
Published: 2019
Subjects:
Information technology > Congresses
Computer science > Congresses
Computer networks > Congresses
Computer security > Congresses
Online Access:http://hdl.handle.net/10725/10301
https://doi.org/10.1109/ACIT.2018.8672677
http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php
https://ieeexplore.ieee.org/document/8672677
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://hdl.handle.net/10725/10301
https://doi.org/10.1109/ACIT.2018.8672677
http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php
https://ieeexplore.ieee.org/document/8672677

Similar Items