Work

An Efficient Dynamic Programming Parallel Algorithm for the 0-1 Knapsack Problem

Year: 2002

Type: conference-paper

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.

Source: Parallel Computing

DOI: 10.1142/9781860949630_0037

Authors: M. ELKIHEL, D. EL BAZ

Institutions: Centre National de la Recherche Scientifique, Laboratoire d'Analyse et d'Architecture des Systèmes

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2324795874

FWCI: 0.617

Cites:

Cited by: 2

Related to: 10