A cost-optimal parallel algorithm for the 0–1 knapsack problem and its performance on multicore CPU and GPU implementations-Reference-Cited by-同舟云学术

A cost-optimal parallel algorithm for the 0–1 knapsack problem and its performance on multicore CPU and GPU implementations

Published:2015-03 Issue: Volume:43 Page:27-42
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Li Kenli,Liu Jing,Wan Lanjun,Yin Shu,Li Keqin

Funder

Key Program of National Natural Science Foundation of China

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

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

Reference32 articles.

1. Privacy and authentication: an introduction to cryptography;Diffie;Proc. IEEE,1979

2. A linear programming approach to the cutting-stock problem;Gilmore;Oper. Res.,1961

3. The dynamic and stochastic knapsack problem with random sized items;Kleywegt;Oper. Res.,2001

4. The dynamic and stochastic knapsack problem with deadlines;Papastavrou;Manage. Sci.,1996

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

1. An Efficient Reduced-Memory GPU-based Dynamic Programming Strategy for Bounded Knapsack Problems;2022 Seventh International Conference on Parallel, Distributed and Grid Computing (PDGC);2022-11-25

2. Exploiting multi-level parallel metaheuristics and heterogeneous computing to boost phylogenetics;Future Generation Computer Systems;2022-02

3. Solving the location problem of front distribution center for omni-channel retailing;Complex & Intelligent Systems;2021-01-24

4. Parallel computational optimization in operations research: A new integrative framework, literature review and research directions;European Journal of Operational Research;2020-11

5. A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster;Applied Sciences;2019-12-09