The growth of multi-constraint random knapsacks with large right-hand sides of the constraints

Authors:
K. Szkatuza
Affiliations:
Systems Research Institute, Polish Academy of Sciences, ul.Newelska 6, 01-447 Warsaw, Poland
Venue:
Operations Research Letters
Year:
1997

Citing 3
Cited 1

On the growth of random knapsacks

Discrete Applied Mathematics
Random knapsacks with many constraints

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The asymptotic value of an m-constraint, n-variable, binary random knapsack is computed for the case of large values of the right-hand sides of the constraints. It is assumed that the problem coefficients are realizations of random variables, m is bounded and n tends to infinity.