Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

SIMPAR: A parallel sparse simplex

From MaRDI portal
Publication:1900665
Jump to:navigation, search

zbMATH Open0833.65052MaRDI QIDQ1900665FDOQ1900665

Yanyan Li

Publication date: 1 November 1995

Published in: Computational and Applied Mathematics (Search for Journal in Brave)





Recommendations

  • scientific article
  • A parallel algorithm for linear programming problems
  • Towards a practical parallelisation of the simplex method
  • Parallelizing the Dual Simplex Method
  • Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2


zbMATH Keywords

parallel computationparallel sparse simplexrobust simplex algorithmSIMPAR


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Linear programming (90C05)



Cited In (4)

  • SIMPAR
  • Title not available (Why is that?)
  • Towards a practical parallelisation of the simplex method
  • Efficient GPU-based implementations of simplex type algorithms





This page was built for publication: SIMPAR: A parallel sparse simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900665)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1900665&oldid=14311383"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 13:53. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki