A parallel algorithm for the knapsack problem using a generation and searching technique-Reference-Cited by-同舟云学术

A parallel algorithm for the knapsack problem using a generation and searching technique

Published:1994-02 Issue:2 Volume:20 Page:233-243
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Chang Henry Ker-Chang,Chen Jonathan Jen-Rong,Shyu Shyong-Jian

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference15 articles.

1. The Design and Analysis of Parallel Algorithms;Akl,1989

2. Time-memory-processor trade-offs;Amirazizi;IEEE Trans. Inf. Theory,1988

3. The two list algorithm for the knapsack problem on a FPS T20;Cosnard;Parallel Comput.,1989

4. New directions in cryptography;Diffie;IEEE Trans. Inf. Theory,1976

5. Efficient parallel algorithm for the knapsack problem;Ferreira,1988

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A cost-optimal parallel algorithm for the 0–1 knapsack problem and its performance on multicore CPU and GPU implementations;Parallel Computing;2015-03

2. GPU implementation of a paralleltwo-listalgorithm for the subset-sum problem;Concurrency and Computation: Practice and Experience;2014-01-09

3. A Note on Developing Optimal and Scalable Parallel Two-List Algorithms;Algorithms and Architectures for Parallel Processing;2012

4. Comparative Study of Several Intelligent Algorithms for Knapsack Problem;Procedia Environmental Sciences;2011

5. Observations on optimal parallelizations of two-list algorithm;Parallel Computing;2010-01