BOUCHAREB, Sara2018-01-302018-01-302017http://dspace.univ-msila.dz:8080//xmlui/handle/123456789/1800In this study we deal with 0/1 knapsack problem, which is one of combinatorial problems known as NP-hard, where one, has to maximize the benefit of objects in a knapsack without exceeding its capacity. We have done a survey and implementation of this approach, known as Sieve approach is based on the sieving operation idea used to sift grains by translating it on an algorithmic tool. Where generates randomly and iteratively a great number of feasible solutions by batches. The implementation is done on a 0/1 knapsack problem and the results are compared to show the approach efficiency. The findings show that our proposed method can give better solutions in large instances items than other method in combinatorial optimization. The performance of our approach has been tested on well-known dataset.enknapsack problem, combinatorial problems, sieve method, optimization.Thesis