Design of parallel algorithms for the single resource allocation problem
Authors:
- D MoralesDMD Morales
- F AlmeidaFAF Almeida
- F Garcı́aFGF Garcı́a
- J.L RodaJRJ.L Roda
- C Rodrı́guezCRC Rodrı́guez
- 1 October 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 126 (1) , 166-174
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Integral knapsack problems1995
- Do hypercubes sort faster than tree machines?Concurrency: Practice and Experience, 1994
- A study of parallel branch-and-bound algorithms with best-bound-first searchParallel Computing, 1989
- Two strategies for solving the vertex cover problem on a transputer networkLecture Notes in Computer Science, 1989
- A hypercube algorithm for the 0/1 Knapsack problemJournal of Parallel and Distributed Computing, 1988
- Partitioning and Mapping Algorithms into Fixed Size Systolic ArraysIEEE Transactions on Computers, 1986
- Multiprocessing of Combinatorial Search ProblemsComputer, 1985