On the public citation graph

A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds

https://doi.org/10.1007/bf02591905
0 signed · 32 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/bf01385880openalex-snapshot
Optimally scaled matrices
inferredcites →https://doi.org/10.1007/bf01396369openalex-snapshot
An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1007/bf01399312openalex-snapshot
Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
inferredcites →https://doi.org/10.1007/bf02165268openalex-snapshot
Remarks on optimally scaled matrices
inferredcites →https://doi.org/10.1007/bfb0120718openalex-snapshot
On scaling linear programming problems
inferredcites →https://doi.org/10.1016/0012-365x(78)90200-5openalex-snapshot
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
inferredcites →https://doi.org/10.1016/0024-3795(79)90114-9openalex-snapshot
An automatic scaling procedure for a D'Yakanov-Gunn iteration scheme
inferredcites →https://doi.org/10.1016/s0024-3795(73)80003-5openalex-snapshot
Cyclic and diagonal products on a matrix
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1057/jors.1983.14openalex-snapshot
Modern Applied Mathematics: Optimization and Operations Research
inferredcites →https://doi.org/10.1080/03081087908817308openalex-snapshot
Cones, graphs and optimal scalings of 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.1111/j.1749-6632.1979.tb32777.xopenalex-snapshot
MINTY COLORINGS AND ORIENTATIONS OF MATROIDS
inferredcites →https://doi.org/10.1112/blms/6.2.218bopenalex-snapshot
GRAPHS AND HYPERGRAPHS
inferredcites →https://doi.org/10.1137/0603044openalex-snapshot
Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems
inferredcites →https://doi.org/10.1137/1004032openalex-snapshot
An Algorithm for Scaling Matrices
inferredcites →https://doi.org/10.1515/9781400881987-004openalex-snapshot
3 . Resolution and Separation Theorems for Polyhedral Convex Sets
inferredcites →https://doi.org/10.21136/cmj.1969.100913openalex-snapshot
Cyclic products and an inequality for determinants
inferredcites →https://doi.org/10.2307/1910243openalex-snapshot
The Theory of Linear Economic Models
inferredcites →https://doi.org/10.2307/2230336openalex-snapshot
Biproportional Matrices and Input Output Change.
inferredcites →https://doi.org/10.4153/cjm-1956-004-9openalex-snapshot
A Class Of Abelian Groups

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-3-0348-5432-0_27openalex-snapshot
Shortest Path Algorithms for the Approximation by Nomographic Functions
inferred← citeshttps://doi.org/10.1007/bf01389759openalex-snapshot
Applications of shortest path algorithms to matrix scalings
inferred← citeshttps://doi.org/10.1007/bf01585655openalex-snapshot
Computing optimal scalings by parametric network algorithms
inferred← citeshttps://doi.org/10.1007/bfb0121080openalex-snapshot
Line-sum-symmetric scalings of square nonnegative matrices
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2008.01.004openalex-snapshot
Divisor methods for proportional representation systems: An optimization approach to vector and matrix apportionment problems
inferred← citeshttps://doi.org/10.1080/02331939308843895openalex-snapshot
On scaling linear programs—some experimental results
inferred← citeshttps://doi.org/10.1137/1.9781611970197openalex-snapshot
Multivariate Approximation Theory
inferred← citeshttps://doi.org/10.13001/1081-3810.1099openalex-snapshot
One-sided simultaneous inequalities and sandwich theorems for diagonal similarity and diagonal equivalence of nonnegative matrices
inferred← citeshttps://doi.org/10.13001/1081-3810.1191openalex-snapshot
On nonnegative sign equivalent and sign similar factorizations of matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1609.06349openalex-snapshot
A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps
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.