Investigating the sparse simplex algorithm on a distributed memory multiprocessor

DOI10.1016/S0167-8191(99)00100-3zbMath1046.68981OpenAlexW2019721604MaRDI QIDQ1606889

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)

Related Items

Parallel search paths for the simplex algorithm, Advances in the Parallelization of the Simplex Method, A projective simplex algorithm using LU decomposition, Towards a practical parallelisation of the simplex method, A generalized dual phase-2 simplex algorithm., Modelling and analysis of multistage stochastic programming problems: A software environment, Pivot versus interior point methods: Pros and cons, Advances in design and implementation of optimization software