A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates (Q1360244)
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 subtree-partitioning algorithm for inducing parallelism in network simplex dual updates |
scientific article; zbMATH DE number 1036103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates |
scientific article; zbMATH DE number 1036103 |
Statements
A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates (English)
0 references
17 July 1997
0 references
network simplex basis subtree
0 references
multiple processes
0 references
parallel network simplex implementation
0 references
0.8767294
0 references
0.87093043
0 references
0.8687235
0 references
0.86812556
0 references
0.86473805
0 references
0.8623119
0 references
0.8608191
0 references
0.8608118
0 references
