The growth of m-constraint random knapsacks (Q920844): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the growth of random knapsacks / rank | |||
Normal rank | |||
Revision as of 10:19, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The growth of m-constraint random knapsacks |
scientific article |
Statements
The growth of m-constraint random knapsacks (English)
0 references
1990
0 references
random knapsack
0 references
asymptotic value
0 references
