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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | conferenceObject |
| منشور في: |
2019
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513486242971648 |
|---|---|
| author | Haraty, Ramzi A. |
| author2 | Assi, Maram |
| author2_role | author |
| author_facet | Haraty, Ramzi A. Assi, Maram |
| author_role | author |
| dc.creator.none.fl_str_mv | Haraty, Ramzi A. Assi, Maram |
| dc.date.none.fl_str_mv | 2019-03-29T11:05:02Z 2019-03-29T11:05:02Z 2019-03-29 |
| dc.identifier.none.fl_str_mv | 9781728103853 http://hdl.handle.net/10725/10301 https://doi.org/10.1109/ACIT.2018.8672677 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 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/document/8672677 |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Information technology -- Congresses Computer science -- Congresses Computer networks -- Congresses Computer security -- Congresses |
| dc.title.none.fl_str_mv | A Survey of the Knapsack Problem |
| dc.type.none.fl_str_mv | Conference Paper / Proceeding info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/conferenceObject |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | conferenceObject |
| id | LAURepo_5b683ad7ba7b6f43371f8ccd8f3a28ec |
| identifier_str_mv | 9781728103853 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 |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/10301 |
| publishDate | 2019 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A Survey of the Knapsack ProblemHaraty, Ramzi A.Assi, MaramInformation technology -- CongressesComputer science -- CongressesComputer networks -- CongressesComputer security -- CongressesThe 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.N/AIncludes bibliographical referencesIEEE2019-03-29T11:05:02Z2019-03-29T11:05:02Z2019-03-29Conference Paper / Proceedinginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject9781728103853http://hdl.handle.net/10725/10301https://doi.org/10.1109/ACIT.2018.8672677Assi, M. and Haraty, R. A. (2018). A Survey of the Knapsack Problem. In 2018 International Arab Conference on Information Technology (ACIT 2018), Werdanye, Lebanon. IEEEhttp://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttps://ieeexplore.ieee.org/document/8672677eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/103012021-03-19T10:45:32Z |
| spellingShingle | A Survey of the Knapsack Problem Haraty, Ramzi A. Information technology -- Congresses Computer science -- Congresses Computer networks -- Congresses Computer security -- Congresses |
| status_str | publishedVersion |
| title | A Survey of the Knapsack Problem |
| title_full | A Survey of the Knapsack Problem |
| title_fullStr | A Survey of the Knapsack Problem |
| title_full_unstemmed | A Survey of the Knapsack Problem |
| title_short | A Survey of the Knapsack Problem |
| title_sort | A Survey of the Knapsack Problem |
| topic | Information technology -- Congresses Computer science -- Congresses Computer networks -- Congresses Computer security -- Congresses |
| url | 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 |