Investigating the sparse simplex algorithm on a distributed memory multiprocessor

DOI10.1016/S0167-8191(99)00100-3MaRDI QIDQ1606889zbMATH OpenOpenAlexFDO

Authors István Maros, Gautam Mitra

Publication date 29 July 2002

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(99)00100-3

zbMATH Keywords

cooperating distributed processing algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• On the efficacy of distributed simplex algorithms for linear programming
• Towards a practical parallelisation of the simplex method
• Parallel distributed-memory simplex for large-scale stochastic LP problems
• scientific article; zbMATH DE number 1064581
• Parallelizing the Dual Simplex Method

Cited in

(11)

• Modelling and analysis of multistage stochastic programming problems: A software environment
• On the efficacy of distributed simplex algorithms for linear programming
• Pivot versus interior point methods: Pros and cons
• Advances in design and implementation of optimization software
• Parallel search paths for the simplex algorithm
• A generalized dual phase-2 simplex algorithm.
• A projective simplex algorithm using LU decomposition
• Advances in the parallelization of the simplex method
• Sparser: A Paradigm for Running Distributed Algorithms
• Integer sparse distributed memory: analysis and results
• Towards a practical parallelisation of the simplex method

This page was built for publication: Investigating the sparse simplex algorithm on a distributed memory multiprocessor

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