scientific article; zbMATH DE number 4039291
combinatorial optimizationcomplexitymergingmodels of computationparallel computer modelssortingsurvey
Software, source code, etc. for problems pertaining to combinatorics (05-04) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
[For the entire collection see Zbl 0599.00013.] This well written paper starts with a survey of parallel computer models and architectures followed by a brief overview of the complexity theory for sequential and parallel computation. The author then focusses on parallel algorithms for combinatorial problems like sorting, merging, graph-theoretic problems, and combinatorial optimization problems. Most algorithms are only briefly mentioned, but a few are given in detail. The paper may be recommended as a starting point to someone new to the field of parallel computation and as a fairly complete guide to the relevant literature.
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Parallel processing for difficult combinatorial optimization problems
- Parallel computations on graphs
- scientific article; zbMATH DE number 3889284 (Why is no real title available?)
- scientific article; zbMATH DE number 3915629 (Why is no real title available?)
- scientific article; zbMATH DE number 4037239 (Why is no real title available?)
- scientific article; zbMATH DE number 4039280 (Why is no real title available?)
- scientific article; zbMATH DE number 52911 (Why is no real title available?)
- Global optimization algorithms for linearly constrained indefinite quadratic problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777451)