A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS (Q4820099): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126248059, #quickstatements; #temporary_batch_1721943449312
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10637199508915502 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968899060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126248059 / rank
 
Normal rank

Latest revision as of 22:55, 25 July 2024

scientific article; zbMATH DE number 2106691
Language Label Description Also known as
English
A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS
scientific article; zbMATH DE number 2106691

    Statements

    A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2004
    0 references

    Identifiers