The generic knapsack factory : decision rules for sequential knapsack problems with an additional constraint Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/vd66w258f

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Consider the situation where one is faced with a sequence of knapsack type problems which involves additional constraints on the permissible number of certain types of knapsack fillers to be used over the sequence. This research is concerned with determining good and perhaps optimal solutions which maximize the total value realized over the sequence and which can be easily computed. Specifically, simple and good, in the sense of nearly optimal, solutions are obtained for the deterministic cases where 1) the knapsack problems in the sequence are identical and 2) the knapsack problems in the sequence are not identical. In both cases, we require that the number of knapsacks in the sequence is known and that the form of each individual knapsack problem is known and hence its solution is available .
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Submitted by Sergio Trujillo (jstscanner@gmail.com) on 2013-10-30T19:59:07Z No. of bitstreams: 1 HehnenMarkThomas1978.pdf: 1414167 bytes, checksum: 9096366f743a33a2fd47330b0372e952 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-10-30T20:14:46Z (GMT) No. of bitstreams: 1 HehnenMarkThomas1978.pdf: 1414167 bytes, checksum: 9096366f743a33a2fd47330b0372e952 (MD5)
  • description.provenance : Made available in DSpace on 2013-11-19T20:29:59Z (GMT). No. of bitstreams: 1 HehnenMarkThomas1978.pdf: 1414167 bytes, checksum: 9096366f743a33a2fd47330b0372e952 (MD5) Previous issue date: 1977-11-18
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-11-19T20:29:59Z (GMT) No. of bitstreams: 1 HehnenMarkThomas1978.pdf: 1414167 bytes, checksum: 9096366f743a33a2fd47330b0372e952 (MD5)

Relationships

In Administrative Set:
Last modified: 08/07/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items