The growth of m-constraint random knapsacks (Q920844): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(90)90303-s / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024867790 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
The growth of m-constraint random knapsacks
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references