Solving the Multi-dimensional 0-1 Knapsack Problem using Depth-k Canonical Cuts.

Simple item page
dc.contributor.advisorShu Fang, Chairen_US
dc.contributor.advisorThom Hodgson, Chairen_US
dc.contributor.advisorRussell King, Minoren_US
dc.contributor.advisorDonald Bitzer, Memberen_US
dc.contributor.advisorMichael Kay, Memberen_US
dc.contributor.advisorSankarasubramanian Arumugam, Graduate School Representativeen_US
dc.contributor.authorPeker Cansizoglu, Aysegulen_US
dc.date.accepted2011-11-15en_US
dc.date.accessioned2012-02-15T06:30:36Z
dc.date.available2012-02-15T06:30:36Z
dc.date.defense2011-08-30en_US
dc.date.embargo2012-02-15en_US
dc.date.issued2011-08-30en_US
dc.date.released2012-02-15en_US
dc.date.reviewed2011-10-20en_US
dc.date.submitted2011-10-20en_US
dc.degree.disciplineIndustrial Engineeringen_US
dc.degree.leveldissertationen_US
dc.degree.nameDoctor of Philosophyen_US
dc.identifier.otherdeg1200en_US
dc.identifier.urihttp://www.lib.ncsu.edu/resolver/1840.16/7479
dc.rightsen_US
dc.titleSolving the Multi-dimensional 0-1 Knapsack Problem using Depth-k Canonical Cuts.en_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
etd.pdf
Size:
1.31 MB
Format:
Adobe Portable Document Format
Download

Collections

Dissertations