Algorithms for assignment problems on an array processor

DOI10.1016/0167-8191(89)90025-2zbMath0678.68023OpenAlexW2026450145WikidataQ57401606 ScholiaQ57401606MaRDI QIDQ1124328

S. H. Smith

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90025-2

zbMATH Keywords

assignment problemsparallel programmingarray processor

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Cellular automata (computational aspects) (68Q80) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items

A user's guide to tabu search, Simulated annealing and tabu search in the long run: A comparison on QAP tasks, A study of diversification strategies for the quadratic assignment problem, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, The single-finger keyboard layout problem, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices