On the public citation graph

A parallelization of the simplex method

https://doi.org/10.1007/bf02186472
0 signed · 22 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01584548openalex-snapshot
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
inferredcites →https://doi.org/10.1007/bf01585094openalex-snapshot
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
inferredcites →https://doi.org/10.1007/bf02169151openalex-snapshot
A stabilization of the simplex method
inferredcites →https://doi.org/10.1016/0010-4655(82)90123-0openalex-snapshot
DAP implementation of the WZ algorithm
inferredcites →https://doi.org/10.1016/0743-7315(84)90009-1openalex-snapshot
Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularity
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50017-9openalex-snapshot
A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University.
inferredcites →https://doi.org/10.1080/00207167908803174openalex-snapshot
A parallel linear system solver
inferredcites →https://doi.org/10.1080/00207168008803201openalex-snapshot
A modification of the quadrant interlocking factorisation parallel method
inferredcites →https://doi.org/10.1080/00207168208803298openalex-snapshot
Further analysis of the quadrant interlocking factorisation (Q.I.F.) method
inferredcites →https://doi.org/10.1137/0907023openalex-snapshot
Implementing Dense Linear Algebra Algorithms Using Multitasking on the CRAY X-MP-4 (or Approaching the Gigaflop)
inferredcites →https://doi.org/10.1287/mnsc.3.3.255openalex-snapshot
The Elimination form of the Inverse and its Application to Linear Programming
inferredcites →https://doi.org/10.7551/mitpress/5239.003.0017openalex-snapshot
A Parallel Linear Algebra Library for the Denelcor HEP

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780471703778.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-1-4614-5134-1_11openalex-snapshot
A Parallel Implementation of the Revised Simplex Algorithm Using OpenMP: Some Preliminary Results
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_17openalex-snapshot
Advances in the Parallelization of the Simplex Method
inferred← citeshttps://doi.org/10.1007/bf01582130openalex-snapshot
Partitioning mathematical programs for parallel solution
inferred← citeshttps://doi.org/10.1007/bf02024486openalex-snapshot
A parallel interior point algorithm for linear programming on a network of transputers
inferred← citeshttps://doi.org/10.1007/s10100-016-0452-9openalex-snapshot
Parallel search paths for the simplex algorithm
inferred← citeshttps://doi.org/10.1007/s10287-008-0080-5openalex-snapshot
Towards a practical parallelisation of the simplex method
inferred← citeshttps://doi.org/10.1145/237578.237620openalex-snapshot
An efficient steepest-edge simplex algorithm for SIMD computers
inferred← citeshttps://doi.org/10.1287/ijoc.12.1.45.11902openalex-snapshot
Parallelizing the Dual Simplex Method
inferred← citeshttps://doi.org/10.4018/ijoris.2014010102openalex-snapshot
A Multivariate Statistical Assessment of the Level of Use of Information Systems in the Public Sector Services in Greece in Order to Oppose Bureaucracy
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.