MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

DOI10.1109/TC.1984.1676453MaRDI QIDQ3309033zbMATH OpenOpenAlexFDO

Authors Y. W. Eva Ma, Benjamin 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

zbMATH Keywords

selectioncommunication networksortingNP-hard problemsparallel processingparallel machinering networkmergingvirtual memoryapproximate branch-and-boundparallel branch- and-boundvertex-covering problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Search theory (90B40) Searching and sorting (68P10) Theory of software (68N99) Theory of operating systems (68N25)

Cited in

(12)

• A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
• Building a parallel branch and bound library
• Parallel best-first branch-and-bound in discrete optimization: a framework
• A randomized parallel branch-and-bound algorithm
• Large-scale 0-1 linear programming on distributed workstations
• Branch-and-bound as a higher-order function
• Branch-and-bound and parallel computation: A historical note
• Parallel depth first search. I: Implementation
• A parallel branch and bound algorithm for the quadratic assignment problem
• Parallel depth first search. II: Analysis
• Efficiency considerations in the implementation of parallel branch-and- bound
• Parallel processing for difficult combinatorial optimization problems

This page was built for publication: MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309033)