Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Fast and scalable parallel algorithms for knapsack-like problems.

From MaRDI portal
Publication:676636
Jump to:navigation, search

DOI10.1006/JPDC.1996.0150zbMath1114.68613OpenAlexW2091143465MaRDI QIDQ676636

Afonso G. Ferreira, John Michael Robson

Publication date: 7 August 1997

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d3a78f24671386ae7bc3ed627cf59b424c053572



Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)


Related Items (2)

An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem ⋮ Handling organ motion in radiotherapy of cancer via Markov chains







This page was built for publication: Fast and scalable parallel algorithms for knapsack-like problems.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:676636&oldid=12585261"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 09:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki