Abstract
We consider 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
