Efficient parallel linear programming

DOI10.1016/0167-6377(86)90085-4zbMath0616.90040OpenAlexW1991512116MaRDI QIDQ1821686

John H. Reif, Pan, Victor Y.

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90085-4

zbMATH Keywords

parallel algorithmsleast squares

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Parallel nested dissection for path algebra computations

Cites Work

• A new polynomial-time algorithm for linear programming
• How to multiply matrices faster
• Rank and optimal computation of generic tensors
• On the complexity of a pivot step of the revised simplex algorithm
• On the asymptotic complexity of rectangular matrix multiplication
• Fast finite methods for a system of linear inequalities
• Dioïds and semirings: Links to fuzzy sets and other applications
• Fast and efficient linear programming and linear least-squares computations
• A Separator Theorem for Planar Graphs
• Generalized Nested Dissection
• Nested Dissection of a Regular Finite Element Mesh
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item