On the public citation graph
New crash procedures for large systems of linear constraints
0 signed · 65 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/nme.1620230208openalex-snapshot
An algorithm for profile and wavefront reduction of sparse matrices
inferredcites →https://doi.org/10.1007/978-3-662-08011-5_5openalex-snapshot
Advanced Linear Programming
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/bf01593804openalex-snapshot
A practicable steepest-edge simplex algorithm
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.1093/imamat/10.1.118openalex-snapshot
On the Automatic Scaling of Matrices for Gaussian Elimination
inferredcites →https://doi.org/10.1137/0713023openalex-snapshot
An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
inferredcites →https://doi.org/10.1137/0722022openalex-snapshot
A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
inferredcites →https://doi.org/10.1145/22899.22904openalex-snapshot
Distribution of mathematical software via electronic mail
inferredcites →https://doi.org/10.1145/355705.355713openalex-snapshot
Algorithm 509: A Hybrid Profile Reduction Algorithm [F1]
inferredcites →https://doi.org/10.1145/355993.355998openalex-snapshot
Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0395openalex-snapshot
Implementing the Simplex Method
inferred← citeshttps://doi.org/10.1002/app.21728openalex-snapshot
Comparative study of cellulose isolated by totally chlorine‐free method from wood and cereal straw
inferred← citeshttps://doi.org/10.1007/978-3-030-73237-0_9openalex-snapshot
User Control of the Optimization Process and Improving Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-319-65919-0_10openalex-snapshot
Exterior Point Simplex Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-65919-0_8openalex-snapshot
Revised Primal Simplex Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-65919-0_9openalex-snapshot
Revised Dual Simplex Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_10openalex-snapshot
Integer Linear Programming (ILP)
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_14openalex-snapshot
Dual Simplex Phase-l Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_16openalex-snapshot
Improved Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_17openalex-snapshot
D-Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_18openalex-snapshot
Criss-Cross Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_19openalex-snapshot
Generalizing Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_2openalex-snapshot
Geometry of the Feasible Region
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_21openalex-snapshot
Dual Deficient-Basis Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_24openalex-snapshot
Pivotal Interior-Point Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_4openalex-snapshot
Duality Principle and Dual Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_5openalex-snapshot
Implementation of the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_6openalex-snapshot
Sensitivity Analysis and Parametric LP
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_7openalex-snapshot
Variants of the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-80117-4_2openalex-snapshot
Finding Better Starting Bases for the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-94-015-8196-7_3openalex-snapshot
Large-Scale Nonlinear Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s12532-020-00188-1openalex-snapshot
A triangulation and fill-reducing initialization procedure for the simplex algorithm
inferred← citeshttps://doi.org/10.1007/s40305-023-00493-1openalex-snapshot
MILP Acceleration: A Survey from Perspectives of Simplex Initialization and Learning-Based Branch and Bound
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.05.030openalex-snapshot
Crash start of interior point methods
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/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.1023/a:1013548430005openalex-snapshot
Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1093/imanum/11.3.299openalex-snapshot
An Algorithm for Large-Scale Quadratic Programming
inferred← citeshttps://doi.org/10.1137/1033001openalex-snapshot
Inertia-Controlling Methods for General Quadratic Programming
inferred← citeshttps://doi.org/10.1137/130931588openalex-snapshot
Preconditioned Iterative Methods for Solving Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/s1052623401393141openalex-snapshot
Reoptimization With the Primal-Dual Interior Point Method
inferred← citeshttps://doi.org/10.1155/2012/482193openalex-snapshot
A Two‐Phase Support Method for Solving Linear Programs: Numerical Experiments
inferred← citeshttps://doi.org/10.11606/d.55.2009.tde-26052009-150427openalex-snapshot
Técnicas computacionais para a implementação eficiente e estável de métodos tipo simplex
inferred← citeshttps://doi.org/10.1287/ijoc.10.2.248openalex-snapshot
Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03376openalex-snapshot
Simplex Initialization: A Survey of Techniques and Trends
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.