Work

A parallel algorithm for the integer knapsack problem

Year: 1996

Type: article

Abstract: A sequential algorithm with complexity O(M2+n) for the integer knapsack problem is presented. M is the capacity of the knapsack, and n the number of objects. The algorithm admits an efficient parallelization on a p-processor ring machine. The corresponding parallel algorithm is O(M2/p+n). The parallel algorithm is compared with a version of the well-known Lee algorithm adapted to the integer knapsack problem. Computational results on both a local area network and a transputer are reported.

Source: Concurrency Practice and Experience

DOI: 10.1002/(sici)1096-9128(199605)8:4<251::aid-cpe203>3.0.co;2-d

Authors: D. Morales, J.L. Roda, C. Rodríguez, F. Almeida, F. García

Institution: Universidad de La Laguna

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W1996086218

FWCI:

Cites:

Cited by:

Related to: 10