Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem

DOI10.1016/j.jpdc.2004.10.004zbMath1080.68739OpenAlexW2123283397MaRDI QIDQ2485128

Didier El Baz, Moussa Elkihel

Publication date: 3 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.10.004

zbMATH Keywords

Dynamic programmingParallel computingLoad balancing0-1 knapsack problemDominance technique

Mathematics Subject Classification ID

Dynamic programming (90C39) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Solving knapsack problems on GPU ⋮ Shift-and-merge technique for the DP solution of the time-constrained backpacker problem ⋮ Heuristics for the 0-1 multidimensional knapsack problem

This page was built for publication: Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem