BACHIRI, Taki Eddine2023-05-102023-05-102016-06-10http://dspace.univ-msila.dz:8080//xmlui/handle/123456789/37621The 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.enThe knapsack problem: Definition and ResolutionThesis