On the public citation graph
A bump triangular dynamic factorization algorithm for the simplex method
0 signed · 28 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800120102openalex-snapshot
A complete constructive algorithm for the general mixed linear programming problem
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3openalex-snapshot
Sparse Matrices and their Applications
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_6openalex-snapshot
The Partitioned Preassigned Pivot Procedure (P4)
inferredcites →https://doi.org/10.1007/bf01580108openalex-snapshot
Pivot selection methods of the Devex LP code
inferredcites →https://doi.org/10.1007/bf01580655openalex-snapshot
The factorization approach to large-scale linear programming
inferredcites →https://doi.org/10.1007/bf01584086openalex-snapshot
Reinversion with the preassigned pivot procedure
inferredcites →https://doi.org/10.1007/bf01584341openalex-snapshot
Matrix augmentation and partitioning in the updating of the basis inverse
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.1016/0016-0032(64)90390-4openalex-snapshot
Rounding errors in algebraic processes
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.1145/362946.362974openalex-snapshot
The simplex method of linear programming using LU decomposition
inferredcites →https://doi.org/10.1287/mnsc.24.10.1031openalex-snapshot
A Spike Collective Dynamic Factorization Algorithm for the Simplex Method
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/2002959openalex-snapshot
Rounding Errors in Algebraic Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01582564openalex-snapshot
Dynamic factorization in large-scale optimization
inferred← citeshttps://doi.org/10.1007/bf01585094openalex-snapshot
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
inferred← citeshttps://doi.org/10.1007/bf02022083openalex-snapshot
Advanced basis construction in linear programming
inferred← citeshttps://doi.org/10.1007/bf02591889openalex-snapshot
Large-scale linear programming: Geometry, working bases and factorizations
inferred← citeshttps://doi.org/10.1016/s0895-7177(98)00074-0openalex-snapshot
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1137/0605007openalex-snapshot
A Hierarchical Representation of the Inverse for Sparse Matrices
inferred← citeshttps://doi.org/10.1137/0606056openalex-snapshot
Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
inferred← citeshttps://doi.org/10.1155/s1173912698000042openalex-snapshot
Managing cost uncertainties in transportation and assignment problems
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0086openalex-snapshot
Implementing an LU Factorization for the Embedded Network Simplex Algorithm
inferred← citeshttps://doi.org/10.1287/inte.28.2.32openalex-snapshot
Advances in Solving the Multicommodity-Flow Problem
inferred← citeshttps://doi.org/10.21236/ada214568openalex-snapshot
Dynamic Factorization in Large-Scale Optimization
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.