Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646)

From MaRDI portal
Revision as of 20:55, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
scientific article

    Statements

    Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (English)
    0 references
    0 references
    0 references
    30 May 1995
    0 references
    relaxation algorithms
    0 references
    massively parallel connection machine
    0 references
    data- parallel implementation
    0 references
    \(\varepsilon\)-relaxation algorithm
    0 references
    min-cost network flow
    0 references
    transportation problems
    0 references
    transshipment problems
    0 references
    hypercube communication network
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references