Pekbey, Duygu2016-07-012016-07-012003http://hdl.handle.net/11693/29395Cataloged from PDF version of article.In this thesis, the potential use of a recently proposed cut (the search based cut) for 0-1 programming problems by Oguz (2002) is analyzed. For this purpose, the search based cuts and a new algorithm based on the search based cuts are applied to multidimensional 0-1 knapsack problems from the literature as well as randomly generated multidimensional 0-1 knapsack problems. The results are compared with the implementation of CPLEX v8.1 in MIP mode and the results reported.x, 64 leaves, 30 cmEnglishinfo:eu-repo/semantics/openAccess0-1 Integer programmingMultidimensional 0-1 Knapsack ProblemT57.74 .P44 2003Integer programming.ThesisBILKUTUPB072171