Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646): Difference between revisions
From MaRDI portal
Latest revision as of 10:24, 23 May 2024
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
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