Computational analysis of the search based cuts on the multidimensional 0-1 knapsack problem
Date
2003
Authors
Editor(s)
Advisor
Oğuz, Osman
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Print ISSN
Electronic ISSN
Publisher
Volume
Issue
Pages
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Attention Stats
Usage Stats
3
views
views
7
downloads
downloads
Series
Abstract
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.
Course
Other identifiers
Book Title
Degree Discipline
Industrial Engineering
Degree Level
Master's
Degree Name
MS (Master of Science)