Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations |
scientific article; zbMATH DE number 710947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations |
scientific article; zbMATH DE number 710947 |
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
