On the public citation graph

Tight bounds on the number of minimum-mean cycle cancellations and related results

https://doi.org/10.1007/bf01240734
0 signed · 45 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/bf01240735openalex-snapshot
A new scaling algorithm for the maximum mean cut problem
inferredcites →https://doi.org/10.1007/bf01580122openalex-snapshot
More pathological examples for network flow problems
inferredcites →https://doi.org/10.1007/bf01580132openalex-snapshot
A bad network problem for the simplex method and other minimum cost flow algorithms
inferredcites →https://doi.org/10.1007/bf01585705openalex-snapshot
Finding minimum-cost flows by double scaling
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02591772openalex-snapshot
The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
inferredcites →https://doi.org/10.1016/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1016/0166-218x(92)90231-xopenalex-snapshot
Negative circuits for flows and submodular flows
inferredcites →https://doi.org/10.1098/rspa.1960.0144openalex-snapshot
Monotone networks
inferredcites →https://doi.org/10.1137/0109002openalex-snapshot
An Out-of-Kilter Method for Minimal-Cost Flow Problems
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/62212.62249openalex-snapshot
A faster strongly polynomial minimum cost flow algorithm
inferredcites →https://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1287/mnsc.14.3.205openalex-snapshot
A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
inferredcites →https://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferredcites →https://doi.org/10.15807/jorsj.31.431openalex-snapshot
A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION
inferredcites →https://doi.org/10.21136/cmj.1975.101334openalex-snapshot
Diagonal similarity and equivalence for matrices over groups with 0
inferredcites →https://doi.org/10.21236/ada214498openalex-snapshot
Finding Minimum-Cost Flows by Double Scaling
inferredcites →https://doi.org/10.21236/ada214689openalex-snapshot
Network Flow Algorithms
inferredcites →https://doi.org/10.21236/ada457044openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferredcites →https://doi.org/10.2307/2003490openalex-snapshot
Finite Graphs and Networks, An Introduction with Applications

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1996.0849openalex-snapshot
Choosing Subsets with Maximum Weighted Average
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_62openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_6openalex-snapshot
Fractional Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_55openalex-snapshot
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
inferred← citeshttps://doi.org/10.1007/s13676-015-0077-5openalex-snapshot
Tools for primal degenerate linear programs: IPS, DCA, and PE
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.058openalex-snapshot
A new approach for computing a most positive cut using the minimum flow algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2017.02.019openalex-snapshot
A strongly polynomial Contraction-Expansion algorithm for network flow problems
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.005openalex-snapshot
About the minimum mean cycle-canceling algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.013openalex-snapshot
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.09.022openalex-snapshot
The minimum mean cycle-canceling algorithm for linear programs
inferred← citeshttps://doi.org/10.1016/j.orl.2014.10.001openalex-snapshot
Decomposition theorems for linear programs
inferred← citeshttps://doi.org/10.1017/9781009093927.004openalex-snapshot
Circuit Imbalance Measures and Linear Programming
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267785openalex-snapshot
Newton's method for fractional combinatorial optimization
inferred← citeshttps://doi.org/10.1137/1.9781611973105.85openalex-snapshot
Smoothed Analysis of the Successive Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1137/21m1439390openalex-snapshot
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory
inferred← citeshttps://doi.org/10.1137/s0097539794263695openalex-snapshot
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
inferred← citeshttps://doi.org/10.1145/1027084.1027085openalex-snapshot
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
inferred← citeshttps://doi.org/10.1186/s42162-018-0030-6openalex-snapshot
Towards negative cycle canceling in wind farm cable layout optimization
inferred← citeshttps://doi.org/10.1287/moor.2022.1326openalex-snapshot
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
inferred← citeshttps://doi.org/10.1287/moor.25.1.76.15208openalex-snapshot
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
inferred← citeshttps://doi.org/10.3990/1.9789036540971openalex-snapshot
Smoothed analysis of belief propagation and minimum-cost flow algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1504.00918openalex-snapshot
Supercritical minimum mean-weight cycles
inferred← citeshttps://doi.org/10.5555/2627817.2627902openalex-snapshot
Smoothed analysis of the successive shortest path algorithm
inferred← citeshttps://doi.org/10.7155/jgaa.00539openalex-snapshot
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
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.