On the public citation graph

Determining GUB sets via an invert agenda algorithm

https://doi.org/10.1007/bf01585520
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/978-1-4615-8675-3_6openalex-snapshot
The Partitioned Preassigned Pivot Procedure (P4)
inferredcites →https://doi.org/10.1007/bf01580428openalex-snapshot
Analysis of mathematical programming problems prior to applying the simplex algorithm
inferredcites →https://doi.org/10.1007/bf01584086openalex-snapshot
Reinversion with the preassigned pivot procedure
inferredcites →https://doi.org/10.1093/comjnl/12.3.232openalex-snapshot
Advanced Linear-Programming Computing Techniques
inferredcites →https://doi.org/10.1145/800184.810500openalex-snapshot
Aspects of large-scale in-core linear programming
inferredcites →https://doi.org/10.1287/mnsc.3.3.255openalex-snapshot
The Elimination form of the Inverse and its Application to Linear Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nav.3800290115openalex-snapshot
A note on splitting the bump in an elimination factorization
inferred← citeshttps://doi.org/10.1007/978-1-4684-1080-8_29openalex-snapshot
Implementation Aspects of Model Management: A Focus on Computer-Assisted Analysis
inferred← citeshttps://doi.org/10.1007/bf01582564openalex-snapshot
Dynamic factorization in large-scale optimization
inferred← citeshttps://doi.org/10.1007/bf01584231openalex-snapshot
Identification of special structure constraints in linear programs
inferred← citeshttps://doi.org/10.1007/bf02022083openalex-snapshot
Advanced basis construction in linear programming
inferred← citeshttps://doi.org/10.1007/bf02564799openalex-snapshot
Detecting embedded pure network structures in LP problems
inferred← citeshttps://doi.org/10.1007/bf02591728openalex-snapshot
Automatic identification of embedded network rows in large-scale optimization models
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90264-vopenalex-snapshot
The practical conversion of linear programmes to network flow models
inferred← citeshttps://doi.org/10.1016/b978-0-12-299680-1.50027-6openalex-snapshot
SOME COMMENTS ON HIDDEN STRUCTURE IN LINEAR PROGRAMS
inferred← citeshttps://doi.org/10.1016/b978-0-12-299680-1.50034-3openalex-snapshot
IMPLEMENTATION ASPECTS OF MODEL MANAGEMENT: A FOCUS ON COMPUTER-ASSISTED ANALYSIS
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50009-xopenalex-snapshot
Recent Algorithms for Two Versions of Graph Realization and Remarks on Applications to Linear Programming
inferred← citeshttps://doi.org/10.1109/tcs.1976.1084136openalex-snapshot
On bordered triangular or lower N forms of an irreducible matrix
inferred← citeshttps://doi.org/10.1145/356022.356024openalex-snapshot
A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models
inferred← citeshttps://doi.org/10.1287/mnsc.26.11.1166openalex-snapshot
Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
inferred← citeshttps://doi.org/10.1287/moor.4.3.274openalex-snapshot
The Principal Maxmin Matrix Transversal Strategy
inferred← citeshttps://doi.org/10.1287/opre.26.2.365openalex-snapshot
Technical Note—Dynamic Generalized Upper Bounding
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.