On the public citation graph
Vector processing in simplex and interior methods for linear programming
0 signed · 63 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.1007/978-1-4613-9617-8openalex-snapshot
Progress in Mathematical Programming
inferredcites →https://doi.org/10.1007/978-1-4613-9617-8_6openalex-snapshot
A Note on Comparing Simplex and Interior Methods for Linear Programming
inferredcites →https://doi.org/10.1007/978-1-4684-6754-3_20openalex-snapshot
The Use of Vector and Parallel Computers in the Solution of Large Sparse Linear Equations
inferredcites →https://doi.org/10.1007/bf01580108openalex-snapshot
Pivot selection methods of the Devex LP code
inferredcites →https://doi.org/10.1007/bf01580729openalex-snapshot
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
inferredcites →https://doi.org/10.1007/bf01584344openalex-snapshot
The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
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/bf01587095openalex-snapshot
An implementation of Karmarkar's algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02592025openalex-snapshot
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
inferredcites →https://doi.org/10.1016/0167-8191(86)90019-0openalex-snapshot
Parallel implementation of multifrontal schemes
inferredcites →https://doi.org/10.1057/jors.1971.94openalex-snapshot
Integer and Non-Linear Programming
inferredcites →https://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferredcites →https://doi.org/10.1093/comjnl/12.3.232openalex-snapshot
Advanced Linear-Programming Computing Techniques
inferredcites →https://doi.org/10.1137/0908086openalex-snapshot
The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory
inferredcites →https://doi.org/10.1137/1026003openalex-snapshot
Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
inferredcites →https://doi.org/10.1145/321556.321565openalex-snapshot
Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
inferredcites →https://doi.org/10.1145/355984.355989openalex-snapshot
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferredcites →https://doi.org/10.1147/sj.251.0051openalex-snapshot
The IBM System/370 vector architecture
inferredcites →https://doi.org/10.1147/sj.251.0063openalex-snapshot
Vector system performance of the IBM 3090
inferredcites →https://doi.org/10.1177/109434208700100403openalex-snapshot
Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers
inferredcites →https://doi.org/10.1287/ijoc.1.2.70openalex-snapshot
An Implementation of a Primal-Dual Interior Point Method for Linear Programming
inferredcites →https://doi.org/10.1287/ijoc.1.2.84openalex-snapshot
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
inferredcites →https://doi.org/10.1287/ijoc.2.4.325openalex-snapshot
Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.37767openalex-extracted
Evpi-Based Importance Sampling Solution Procedures for Multistage Stochastic Linear Programmes on Parallel Mimd Architectures
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_8openalex-snapshot
The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-322-86127-6_15openalex-snapshot
Betriebswirtschaftliche Planung und mathematische Optimierung
inferred← citeshttps://doi.org/10.1007/978-3-642-31464-3_15openalex-snapshot
A High Performance Dual Revised Simplex Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-76123-2_9openalex-snapshot
Vernetzte PC als Parallelrechner für gemischt-ganzzahlige Optimierung
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_13openalex-snapshot
Computational Methods For Linear Programming
inferred← citeshttps://doi.org/10.1007/bf01299209openalex-snapshot
On the efficacy of distributed simplex algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/bf01581089openalex-snapshot
Steepest-edge simplex algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/s10287-008-0080-5openalex-snapshot
Towards a practical parallelisation of the simplex method
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90279-6openalex-snapshot
Massive memory buys little speed for complete, in-core sparse Cholesky factorization on some scalar computers
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50010-1openalex-snapshot
ADAPTING THE INTERIOR POINT METHOD FOR THE SOLUTION OF LINEAR PROGRAMS ON HIGH PERFORMANCE COMPUTERS
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00100-3openalex-snapshot
Investigating the sparse simplex algorithm on a distributed memory multiprocessor
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00072-3openalex-snapshot
Advances in design and implementation of optimization software
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00027-6openalex-snapshot
The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80208-7openalex-snapshot
Chapter 11 Mathematical programming systems
inferred← citeshttps://doi.org/10.1017/s0962492900002300openalex-snapshot
Interior methods for constrained optimization
inferred← citeshttps://doi.org/10.1023/a:1018956530304openalex-snapshot
EVPI‐based importance sampling solution proceduresfor multistage stochastic linear programmeson parallel MIMD architectures
inferred← citeshttps://doi.org/10.1023/a:1018957107705openalex-snapshot
ASYNPLEX, an asynchronous parallelrevised simplex algorithm
inferred← citeshttps://doi.org/10.1057/jors.1990.21openalex-snapshot
Linear Programming on Cray Supercomputers
inferred← citeshttps://doi.org/10.1057/jors.1992.77openalex-snapshot
Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
inferred← citeshttps://doi.org/10.1080/02331939308843876openalex-snapshot
Implementing cholesky factorization for interior point methods of linear programming
inferred← citeshttps://doi.org/10.1109/59.932264openalex-snapshot
On the application of high performance computation techniques to nonlinear interior point methods
inferred← citeshttps://doi.org/10.1109/mper.2001.4311431openalex-snapshot
On the Application of Highperformance Computation Techniquest to Nonlinear Interior Point Methods
inferred← citeshttps://doi.org/10.1134/s1995423915040011openalex-snapshot
A simplex method algorithm using a double basis
inferred← citeshttps://doi.org/10.1137/0806006openalex-snapshot
An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
inferred← citeshttps://doi.org/10.1145/264029.264031openalex-snapshot
Distributed nested decomposition of staircase linear programs
inferred← citeshttps://doi.org/10.1147/sj.311.0011openalex-snapshot
Implementing the simplex method for the Optimization Subroutine Library
inferred← citeshttps://doi.org/10.1147/sj.311.0026openalex-snapshot
Implementing interior point linear programming methods in the Optimization Subroutine Library
inferred← citeshttps://doi.org/10.1287/inte.21.1.62openalex-snapshot
Recent Advances in Crew-Pairing Optimization at American Airlines
inferred← citeshttps://doi.org/10.1287/opre.40.5.885openalex-snapshot
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
inferred← citeshttps://doi.org/10.15372/sjnm20150401openalex-snapshot
An algorithm of the simplex method using a dual basis
inferred← citeshttps://doi.org/10.3390/ma15248878openalex-snapshot
Probabilistic Analysis of Composite Materials with Hyper-Elastic Components
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.