Investigating the sparse simplex algorithm on a distributed memory multiprocessor-Reference-Cited by-同舟云学术

Investigating the sparse simplex algorithm on a distributed memory multiprocessor

Published:2000-01 Issue:1 Volume:26 Page:151-170
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Maros I.,Mitra G.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference30 articles.

1. Validity of the single processor approach to achieving large scale computing capabilities;Amdahl;AFIPS Conference Proceedings,1967

2. Advances in Linear and Integer Programming,1996

3. M. Benichou, Gautier, Hentges, Ribiere, The efficient solution of large-scale linear programming problems, Mathematical Programming (13) (1977) 280–322

4. R.E. Bixby, A. Martin, Parallelizing the Dual Simplex Method, Konrad Zuse Zentrum, Berlin, Preprint SC-95-45, December 1995

5. Data mapping of linear programming on fixed size hypercubes;Chen;Parallel Computing,1990

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel search paths for the simplex algorithm;Central European Journal of Operations Research;2016-08-12

2. Advances in the Parallelization of the Simplex Method;Algorithms, Probability, Networks, and Games;2015

3. A GPU-Based Parallel Algorithm for Large Scale Linear Programming Problem;Intelligent Decision Technologies;2011

4. Towards a practical parallelisation of the simplex method;Computational Management Science;2008-10-11

5. The organization of thinking: What functional brain imaging reveals about the neuroarchitecture of complex cognition;Cognitive, Affective, & Behavioral Neuroscience;2007-09