Efficient parallel linear programming

Published

Journal Article

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. © 1986.

Full Text

Duke Authors

Cited Authors

  • Pan, V; Reif, J

Published Date

  • January 1, 1986

Published In

Volume / Issue

  • 5 / 3

Start / End Page

  • 127 - 135

International Standard Serial Number (ISSN)

  • 0167-6377

Digital Object Identifier (DOI)

  • 10.1016/0167-6377(86)90085-4

Citation Source

  • Scopus