Efficient parallel linear programming (Q1821686): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90085-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991512116 / rank | |||
Normal rank | |||
Revision as of 14:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel linear programming |
scientific article |
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
