Graduate Thesis Or Dissertation
 

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

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/vd66w258f

Descriptions

Attribute NameValues
Creator
Abstract
  • 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 Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Publisher
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

Relationships

Parents:

This work has no parents.

In Collection:

Items

Thumbnail Title Date Uploaded Visibility Actions
file details HehnenMarkThomas1978.pdf 2017-08-07 Public Download