No label defined (Q3221759)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3889284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3889284 |
Statements
1985
0 references
parallel algorithms
0 references
combinatorial optimization
0 references
sequencing
0 references
0.8739298582077026
0 references
[For the entire collection see Zbl 0547.00052.] Parallel computing is receiving a rapidly increasing amount of attention. In theory, a collection of processors that operate in parallel can achieve substantial speedups. In practice, technological developments are leading to the actual construction of such devices at low cost. Given the inherent limitations of traditional sequential computers, these prospects turn out to be very stimulating for researchers interested in the design of computers and algorithms. In this bibliography, we have tried to collect the literature on parallel computing that is relevant for the mathematics of operations research, in particular for the theory of combinatorial optimization. It is organized into five chapters with the following headings: Models (classification and surveys, interconnection networks), complexity, numerical problems (evaluation of expressions and recurrence relations, numerical analysis and algebra, nonlinear optimization), combinatorics (sorting, permutation, data transmission, graph theory), combinatorial optimization (sequencing, scheduling, maximum flow, NP-hard problems, knapsack, traveling salesman, dynamic programming, branch-and-bound).
0 references