MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
From MaRDI portal
Publication:3309033
DOI10.1109/TC.1984.1676453zbMath0528.68005OpenAlexW2050733200MaRDI QIDQ3309033
Y. W. Eva Ma, Benjamin W.-S. Wah
Publication date: 1984
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1984.1676453
sortingselectionparallel machineparallel processingvirtual memorycommunication networkNP-hard problemsring networkmergingapproximate branch-and-boundparallel branch- and-boundvertex-covering problem
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Search theory (90B40) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Theory of software (68N99)
Related Items
A parallel branch and bound algorithm for the quadratic assignment problem, Branch-and-bound and parallel computation: A historical note, A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions, Parallel depth first search. I: Implementation, Parallel depth first search. II: Analysis, A randomized parallel branch-and-bound algorithm, Branch-and-bound as a higher-order function, Large-scale 0-1 linear programming on distributed workstations, Parallel processing for difficult combinatorial optimization problems, Efficiency considerations in the implementation of parallel branch-and- bound
