Using optimization to break the epsilon barrier: a faster and simpler width-independent algorithm for solving positive linear programs in parallel (Q5363010)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6786325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using optimization to break the epsilon barrier: a faster and simpler width-independent algorithm for solving positive linear programs in parallel |
scientific article; zbMATH DE number 6786325 |
Statements
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel (English)
0 references
5 October 2017
0 references
0.8327581882476807
0 references
0.7987518906593323
0 references
0.7983665466308594
0 references
0.7709157466888428
0 references
