On the public citation graph
Minimal cost flows in regular matroids
0 signed · 25 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/bf01580122openalex-snapshot
More pathological examples for network flow problems
inferredcites →https://doi.org/10.1016/0012-365x(78)90055-9openalex-snapshot
A general Hungarian method for the algebraic transportation problem
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0095-8956(77)90031-4openalex-snapshot
The matroids with the max-flow min-cut property
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/0166-218x(80)90052-9openalex-snapshot
Algebraic flows in regular matroids
inferredcites →https://doi.org/10.1090/s0002-9947-1958-0101526-0openalex-snapshot
A Homotopy Theorem for Matroids, I
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.2307/2284618openalex-snapshot
Combinatorial Mathematics and Its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(198708)34:4<487::aid-nav3220340404>3.0.co;2-9openalex-snapshot
On the use of lexicographic min cost flows in evacuation modeling
inferred← citeshttps://doi.org/10.1002/net.3230120413openalex-snapshot
Determining minimal cuts with a minimal number of arcs
inferred← citeshttps://doi.org/10.1007/bf01581095openalex-snapshot
An analogue of Hoffman's circulation conditions for max-balanced flows
inferred← citeshttps://doi.org/10.1007/bf02249936openalex-snapshot
Decomposition of group flows in regular matroids
inferred← citeshttps://doi.org/10.1007/s10479-011-0953-9openalex-snapshot
Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
inferred← citeshttps://doi.org/10.1007/s10878-008-9159-8openalex-snapshot
Capacity inverse minimum cost flow problem
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0168-4openalex-snapshot
Max-balanced flows in oriented matroids
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90179-eopenalex-snapshot
Characterizations of max-balanced flows
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.034openalex-snapshot
On the generality of the greedy algorithm for solving matroid base problems
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72446-0openalex-snapshot
An Algorithm for Submodular Functions on Graphs
inferred← citeshttps://doi.org/10.1109/cdc.1989.70312openalex-snapshot
Temporally repeated flow algorithms for dynamic min cost flows
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.