z-logo
open-access-imgOpen Access
An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem
Author(s) -
Moussa Elkihel,
Didier El Baz
Publication year - 2001
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - knapsack problem , computer science , dynamic programming , continuous knapsack problem , parallel computing , polynomial time approximation scheme , algorithm , mathematical optimization , mathematics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom