Computational analysis of the search based cuts on the multidimensional 0-1 knapsack problem

Simple item page
buir.advisorOğuz, Osman
dc.contributor.authorPekbey, Duygu
dc.date.accessioned2016-07-01T10:59:00Z
dc.date.available2016-07-01T10:59:00Z
dc.date.issued2003
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractIn 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.en_US
dc.description.provenanceMade available in DSpace on 2016-07-01T10:59:00Z (GMT). No. of bitstreams: 1 0002401.pdf: 630768 bytes, checksum: cfd5e9ac0292be113f1fb159dee0d18a (MD5) Previous issue date: 2003en
dc.description.statementofresponsibilityPekbey, Duyguen_US
dc.format.extentx, 64 leaves, 30 cmen_US
dc.identifier.itemidBILKUTUPB072171
dc.identifier.urihttp://hdl.handle.net/11693/29395
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subject0-1 Integer programmingen_US
dc.subjectMultidimensional 0-1 Knapsack Problemen_US
dc.subject.lccT57.74 .P44 2003en_US
dc.subject.lcshInteger programming.en_US
dc.titleComputational analysis of the search based cuts on the multidimensional 0-1 knapsack problemen_US
dc.typeThesisen_US
thesis.degree.disciplineIndustrial Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
0002401.pdf
Size:
615.98 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science