An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2002

An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem

(1) , (1)
1
Moussa Elkihel
  • Function : Author
  • PersonId : 840524
Didier El Baz

Abstract

An efficient parallel algorithm for the 0-1 knapsack problem is presented. The algorithm is based on dynamic progamming in conjunction with dominance state techniques. An original load balancing strategy wich is designed in order to achieve good efficiency of the parallel algorithm is proposed. Finally computational results obtained with an Origin 2000 supercomputer are displaed and anlyzed.
Fichier principal
Vignette du fichier
ws-p8-50x6-00 (1).pdf (123.07 Ko) Télécharger le fichier
Vignette du fichier
ws-p8-50x6-00.pdf (123.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)

Dates and versions

hal-01152479 , version 1 (17-05-2015)

Identifiers

  • HAL Id : hal-01152479 , version 1

Cite

Moussa Elkihel, Didier El Baz. An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem. Parallel Computing Conference, ParCo 2001, Sep 2001, Naples, Italy. pp.298-305. ⟨hal-01152479⟩
79 View
155 Download

Share

Gmail Facebook Twitter LinkedIn More