Optimization Algorithms for New Computer Architectures with Applications to Personnel Assignment Models

摘要

One of the most important computer architecture innovations to appear in the market place during the last ten years is parallel processing on a shared memory multicomputer. This report presents our empirical results on a Sequent Symmetry S81 on four optimization models which are used in the area of personnel assignment. Both the detailed algorithms and computational results are presented. Contents: Minimal Spanning Trees - An Empirical Investigation of Parallel Algorithms; Dijkstra's Two-tree Shortest Path Algorithm; An Empirical Analysis of the Dense Assignment Problem; and Solving Generalized Network Problems on a Shared Memory Multiprocessor. (kr)