Efficient parallel linear programming
type: Item
instance of: scholarly article
title: Efficient parallel linear programming
zbMATH Open document ID: 0616.90040
DOI: 10.1016/0167-6377(86)90085-4
published in: Operations Research Letters
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3999650
zbMATH Keywords: least squares
zbMATH Keywords: parallel algorithms
author: Victor Y. Pan
author: J. Reif
MaRDI profile type: Publication
full work available at URL: 0167-6377(86)90085-4
OpenAlex ID: W1991512116
cites work: Q4121360
cites work: Q4079613
cites work: Nested Dissection of a Regular Finite Element Mesh
cites work: Q5185900
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: A new polynomial-time algorithm for linear programming
cites work: Generalized Nested Dissection
cites work: A Separator Theorem for Planar Graphs
cites work: On the asymptotic complexity of rectangular matrix multiplication
cites work: Q4039868
cites work: How to multiply matrices faster
cites work: Fast finite methods for a system of linear inequalities
cites work: On the complexity of a pivot step of the revised simplex algorithm
cites work: Q3761693
cites work: Fast and efficient linear programming and linear least-squares computations
cites work: Q3321331
cites work: Q4156154
cites work: Rank and optimal computation of generic tensors
description: scientific article; zbMATH DE number 3999650