On the Growth of Random Knapsacks

Abstract

This document considers the problem of optimally filling a knapsack of fixed capacity by choosing from among a collection of n objects of randomly determined weight and value. Under very mild conditions on the common joint distribution of weight and value, we determine the asymptotic value of the optimal knapsack, for large n. Keywords: Random variables.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 15, 1988
Accession Number
ADA204653

Entities

People

  • John W. Mamer
  • Kenneth E. Schilling

Organizations

  • University of California, Los Angeles

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computations
  • Computing-Related Activities
  • Evolutionary Algorithms
  • Heuristic Methods
  • Inequalities
  • Interdisciplinary Science
  • Intervals
  • Mathematical Analysis
  • Mathematics
  • Michigan
  • Operations Research
  • Probability
  • Random Variables
  • Sequences
  • Universities

Readers

  • Operations Research
  • Statistical inference.