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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
