Efficient parallel linear programming

Authors:
Victor Pan;John Reif
Affiliations:
Computer Science Department, State University of New York, Albany, NY 12203, USA;Aitken Computation Laboratory, Division of Applied Sciences, Harvard University, Cambridge, MA 02138, USA
Venue:
Operations Research Letters
Year:
1986

Citing 6
Cited 0

Graphs and algorithms

Graphs and algorithms
How to multiply matrices faster

How to multiply matrices faster
A new polynomial-time algorithm for linear programming

Combinatorica
Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices

Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Fast rectangular matrix multiplication (algebraic computational, asymptotic complexity)

Fast rectangular matrix multiplication (algebraic computational, asymptotic complexity)
The asymptotic spectrum of tensors and the exponent of matrix multiplication

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear programming and least squares computations are accelerated using author's 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.