A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS

DOI10.1080/10637199508915502MaRDI QIDQ4820099zbMATH OpenOpenAlexWikidataFDO

Authors F. Almeida, F. Garcia, D. González, C. Rodríguez

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199508915502

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Cites work

• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

Cited in

(1)

• From the theory to the tools: parallel dynamic programming

This page was built for publication: A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820099)