An efficient parallel algorithm for solving the knapsack problem on hypercubes

DOI10.1016/J.JPDC.2002.10.001zbMath1062.90054OpenAlexW1987136648MaRDI QIDQ705566

Alfredo Goldman, Denis Trystram

Publication date: 31 January 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.2002.10.001

zbMATH Keywords

SchedulingKnapsack problemHypercubeIrregular mesh

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39) Parallel algorithms in computer science (68W10)

Related Items (1)

Parallel time and space upper-bounds for the subset-sum problem

This page was built for publication: An efficient parallel algorithm for solving the knapsack problem on hypercubes