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

An improved parallel algorithm for 0/1 knapsack problem

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

DOI10.1016/0167-8191(92)90047-BzbMath0792.68050OpenAlexW2081963429MaRDI QIDQ1195150

Jin-Hwang Jang, Gen-Huey Chen

Publication date: 8 November 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90047-b


zbMATH Keywords

parallel algorithmOccamtransputer0/1 knapsack problem


Mathematics Subject Classification ID

Distributed algorithms (68W15)


Related Items (3)

A new algorithm for the integer knapsack problem and its parallelization ⋮ From the theory to the tools: parallel dynamic programming ⋮ LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS




This page was built for publication: An improved parallel algorithm for 0/1 knapsack problem

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