Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

DOI10.1287/IJOC.7.4.402MaRDI QIDQ4869756zbMATH OpenOpenAlexFDO

Authors Jonathan Eckstein, İ. İlkay Boduroğlu, L. C. Polymenakos, Donald Goldfarb

Publication date 20 May 1996

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d9ac089114c9bd79b70ac1073a361cf30682c357

zbMATH Keywords

data-parallel implementations of the simplex method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Linear programming (90C05)

Recommendations

• Parallelizing the Dual Simplex Method
• scientific article; zbMATH DE number 1041084
• Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
• The network simplex method on a multiprocessor

Cited in

(10)

• Advances in the parallelization of the simplex method
• Peer‐to‐peer distributed text classifier learning in PADMINI
• Implementing the simplex method for the Optimization Subroutine Library
• Parallelizing the Dual Simplex Method
• Parallel search paths for the simplex algorithm
• The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
• scientific article; zbMATH DE number 125195 (Why is no real title available?)
• Towards a practical parallelisation of the simplex method
• Efficient GPU-based implementations of simplex type algorithms
• SIMPAR: A parallel sparse simplex

Describes a project that uses

Uses Software

• NETLIB LP Test Set

This page was built for publication: Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

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