On the public citation graph

A generalized inverse method for asymptotic linear programming

0 signed · 21 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.1016/0024-3795(81)90006-9openalex-snapshot
Resolvent expansions of matrices and applications
inferredcites →https://doi.org/10.1080/00029890.1958.11991949openalex-snapshot
Pseudo-Inverses in Associative Rings and Semigroups
inferredcites →https://doi.org/10.1137/0131035openalex-snapshot
Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients
inferredcites →https://doi.org/10.1137/0608065openalex-snapshot
An Efficient Factorization for the Group Inverse
inferredcites →https://doi.org/10.1137/0610009openalex-snapshot
Generalized Inverses in Discrete Time Markov Decision Processes
inferredcites →https://doi.org/10.1214/aoms/1177697379openalex-snapshot
Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
inferredcites →https://doi.org/10.1214/aoms/1177704593openalex-snapshot
Discrete Dynamic Programming
inferredcites →https://doi.org/10.1287/opre.21.5.1128openalex-snapshot
Asymptotic Linear Programming
inferredcites →https://doi.org/10.14288/1.0097294openalex-snapshot
Matrix methods in queueing and dynamic programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4615-0805-2_4openalex-snapshot
Singular Perturbations of Markov Chains and Decision Processes
inferred← citeshttps://doi.org/10.1007/s00186-006-0095-zopenalex-snapshot
Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90372-uopenalex-snapshot
An efficient basis update for asymptotic linear programming
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00090-9openalex-snapshot
A canonical form for pencils of matrices with applications to asymptotic linear programs
inferred← citeshttps://doi.org/10.1016/j.jcp.2015.07.006openalex-snapshot
Laurent expansion of the inverse of perturbed, singular matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2004.05.018openalex-snapshot
The asymptotic optimal partition and extensions of the Nonsubstitution Theorem
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00152-9openalex-snapshot
An asymptotic simplex method for singularly perturbed linear programs
inferred← citeshttps://doi.org/10.1017/s0269964800003715openalex-snapshot
Markov Branching Decision Chains with Interest-Rate-Dependent Rewards
inferred← citeshttps://doi.org/10.1109/idc.1999.754195openalex-snapshot
An asymptotic simplex method for parametric linear programming
inferred← citeshttps://doi.org/10.1137/0610009openalex-snapshot
Generalized Inverses in Discrete Time Markov Decision Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1764openalex-snapshot
A Non-Triviality Certificate for Scalars and its application to Linear Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1206.4236openalex-snapshot
Efficiently expressing feasibility problems in Linear Systems, as feasibility problems in Asymptotic-Linear-Programs
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.