A parallel asynchronous implementation of the \(\epsilon\)-relaxation method for the linear minimum cost flow problem (Q1391202)
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: A parallel asynchronous implementation of the \(\epsilon\)-relaxation method for the linear minimum cost flow problem |
scientific article; zbMATH DE number 1177830
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel asynchronous implementation of the \(\epsilon\)-relaxation method for the linear minimum cost flow problem |
scientific article; zbMATH DE number 1177830 |
Statements
A parallel asynchronous implementation of the \(\epsilon\)-relaxation method for the linear minimum cost flow problem (English)
0 references
22 July 1998
0 references
network optimization
0 references
linear minimum cost flow problem
0 references
\(\epsilon\)-relaxation method
0 references
distributed memory systems
0 references
asynchronous parallel algorithms
0 references
speedup
0 references
0.897182285785675
0 references
0.8938299417495728
0 references
0.8896835446357727
0 references
0.8877519965171814
0 references
0.8633753657341003
0 references
