GPU Implementation of the Branch and Bound Method for Knapsack Problems

In this paper, we propose an efficient implementation of the branch and bound method for knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can be carried out either on the CPU or on a GPU according to the size of the branch and bound list. A better management of GPUs memo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops S. 1769 - 1777
Hauptverfasser:	Lalami, M. E., El-Baz, D.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.2012
Schlagworte:	branch and bound method Central Processing Unit combinatorial optimization Computer architecture CUDA GPU computing Graphics processing unit hybrid computing Instruction sets Kernel knapsack problems Optimization Upper bound
ISBN:	1467309745, 9781467309745
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!