A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem

From MaRDI portal

Revision as of 00:46, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5375394

Jump to:navigation, search

DOI10.1109/12.73593zbMath1395.90242OpenAlexW2151152538MaRDI QIDQ5375394

Afonso G. Ferreira

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.73593

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

An efficient pruning algorithm for value independent knapsack problem using a DAG structure ⋮ An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem

This page was built for publication: A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5375394&oldid=20095381"