An introduction to parallelism in combinatorial optimization (Q1076605)

From MaRDI portal
Revision as of 13:32, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An introduction to parallelism in combinatorial optimization
scientific article

    Statements

    An introduction to parallelism in combinatorial optimization (English)
    0 references
    0 references
    0 references
    1986
    0 references
    sorting
    0 references
    shortest paths
    0 references
    scheduling
    0 references
    knapsack
    0 references
    branch and bound
    0 references
    traveling salesman
    0 references
    parallel computers
    0 references
    combinatorial optimization
    0 references
    complexity theory for parallel computations
    0 references
    polylog parallel algorithms
    0 references
    log space completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references