Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference27 articles.
1. Merging and sorting applied to the zero–one knapsack problem;Ahrens;Oper. Res.,1975
2. R. Andonov, F. Gruau, A linear systolic array for the knapsack problem, Proceedings of the International Conference on Application Specific Array Processors, vol. 23, 1991, pp. 458–472.
3. R. Andonov, P. Quinton, Efficient linear systolic array for the knapsack problem, in: L. Bougé, M. Cosnard, Y Robert, D. Trystram (Eds.), Parallel Processing: CONPAR 92 - VAPP V, vol. 634, Lecture Notes in Computer Science, Springer, Berlin, 1992, pp. 247–258.
4. H. Bouzoufi, S. Boulenouar, R. Andonov, Pavage optimal pour des dépendances de type sac à dos, Actes du Colloque RenPar’10, 1998.
5. Dynamic programming and parallel computers;Casti;J. Optim. Theory Appl.,1973
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献