Efficient parallel linear programming (Q1821686)
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 3999650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient parallel linear programming |
scientific article; zbMATH DE number 3999650 |
Statements
Efficient parallel linear programming (English)
0 references
1986
0 references
Linear programming and least squares computations are accelerated using authors' parallel algorithms for solving linear systems. The implications on the performance of the Karmarkar and the simplex algorithms for dense and sparse linear programs are examined. The results have further applications to combinatorial algorithms.
0 references
least squares
0 references
parallel algorithms
0 references
0.8426375985145569
0 references
0.8293278813362122
0 references
