The knapsack problem: Definition and Resolution

Simple item page
dc.contributor.authorBACHIRI, Taki Eddine
dc.date.accessioned2023-05-10T08:14:46Z
dc.date.available2023-05-10T08:14:46Z
dc.date.issued2016-06-10
dc.description.abstractThe knapsack problem is a COP problem (Combinatorial Optimization Problem) derived from arti cial intelligence elds. This problem can be seen as NP (Non Probabilistic Problem) because there is an exponential combination of instances, where the entirety set can't be solved by any technique or method. There are variations relating to this problem: problem with limited number of products, problems with unlimited number of products, multiple choice problems, choosing a di erent product from some categories, weight's products problem, economical amount problem, among others. This dissertation aims at giving an overview of this problem and its application in real life.en_US
dc.identifier.urihttp://dspace.univ-msila.dz:8080//xmlui/handle/123456789/37621
dc.language.isoenen_US
dc.publisherUniversity of M'silaen_US
dc.subjectThe knapsack problem: Definition and Resolutionen_US
dc.titleThe knapsack problem: Definition and Resolutionen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Taki Eddine BACHIRI.pdf
Size:
7.62 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Master Thesis