The growth of m-constraint random knapsacks

The growth of m-constraint random knapsacks

0.00 Avg rating0 Votes
Article ID: iaor1992669
Country: Netherlands
Volume: 46
Issue: 1
Start Page Number: 109
End Page Number: 112
Publication Date: May 1990
Journal: European Journal of Operational Research
Authors:
Abstract:

The author computes the asymptotic value of a particular m-constraint, n-variable 0-1 random integer programming problem as n increase, m remaining fixed. This solves a problem of Frieze and Clarke.

Reviews

Required fields are marked *. Your email address will not be published.