On the public citation graph
On the computational behavior of a polynomial-time network flow algorithm
0 signed · 90 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/bf01585705openalex-snapshot
Finding minimum-cost flows by double scaling
inferredcites →https://doi.org/10.1007/bf01586087openalex-snapshot
A unified framework for primal-dual methods in minimum cost network flow problems
inferredcites →https://doi.org/10.1007/bf01589405openalex-snapshot
Dual coordinate step methods for linear network flow problems
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bfb0121089openalex-snapshot
An efficient implementation of the network simplex method
inferredcites →https://doi.org/10.1016/0020-0190(78)90016-9openalex-snapshot
An O(|V|3) algorithm for finding maximum flows in networks
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-0000(85)90039-xopenalex-snapshot
Scaling algorithms for network problems
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(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/s1474-6670(17)55135-6openalex-snapshot
Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
inferredcites →https://doi.org/10.1057/jors.1981.67openalex-snapshot
Discrete Structures and Algorithms
inferredcites →https://doi.org/10.1137/0109002openalex-snapshot
An Out-of-Kilter Method for Minimal-Cost Flow Problems
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/62212.62249openalex-snapshot
A faster strongly polynomial minimum cost flow algorithm
inferredcites →https://doi.org/10.1287/mnsc.20.5.814openalex-snapshot
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
inferredcites →https://doi.org/10.1287/mnsc.24.1.1openalex-snapshot
Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
inferredcites →https://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferredcites →https://doi.org/10.1287/opre.34.2.250openalex-snapshot
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
inferredcites →https://doi.org/10.21236/ada457044openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
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(199106)38:3<413::aid-nav3220380310>3.0.co;2-jopenalex-snapshot
Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1006/jagm.1995.0805openalex-snapshot
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_6openalex-snapshot
Minimum Cost Network Flow Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-0754-6_13openalex-snapshot
Optimal Flows in Dynamic Networks and Algorithms for their Finding
inferred← citeshttps://doi.org/10.1007/978-3-642-12686-4_2openalex-snapshot
Algorithms for Finding Optimal Flows in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_14openalex-snapshot
An Efficient Implementation of the Network Simplex Method
inferred← citeshttps://doi.org/10.1007/bf01589405openalex-snapshot
Dual coordinate step methods for linear network flow problems
inferred← citeshttps://doi.org/10.1007/bf02186476openalex-snapshot
The auction algorithm: A distributed relaxation method for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf02614372openalex-snapshot
Multiflows and disjoint paths of minimum total cost
inferred← citeshttps://doi.org/10.1007/bfb0049391openalex-snapshot
Optimization algorithms for large networks
inferred← citeshttps://doi.org/10.1007/s00224-017-9776-7openalex-snapshot
Minimum-Cost Flows in Unit-Capacity Networks
inferred← citeshttps://doi.org/10.1007/s00453-004-1085-2openalex-snapshot
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem
inferred← citeshttps://doi.org/10.1007/s10107-010-0378-2openalex-snapshot
Separation, dimension, and facet algorithms for node flow polyhedra
inferred← citeshttps://doi.org/10.1007/s11069-015-2134-7openalex-snapshot
Emergency evacuation planning against dike-break flood: a GIS-based DSS for flood detention basin of Jingjiang in central China
inferred← citeshttps://doi.org/10.1007/s40305-025-00620-0openalex-snapshot
Time-Dependent Minimum Cost Dynamic Flow Problems
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90025-jopenalex-snapshot
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
inferred← citeshttps://doi.org/10.1016/j.orl.2020.04.004openalex-snapshot
An implementation of steepest-descent augmentation for linear programs
inferred← citeshttps://doi.org/10.1016/j.trb.2014.05.016openalex-snapshot
Cost scaling based successive approximation algorithm for the traffic assignment problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00052-1openalex-snapshot
A fast cost scaling algorithm for submodular flow
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00047-4openalex-snapshot
A new scaling algorithm for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.1016/s0895-7177(98)00074-0openalex-snapshot
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)55135-6openalex-snapshot
Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
inferred← citeshttps://doi.org/10.1017/9781316888568.003openalex-snapshot
Preliminaries: Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.005openalex-snapshot
Global Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.006openalex-snapshot
More Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.007openalex-snapshot
Minimum-Cost Circulation Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.008openalex-snapshot
Generalized Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.009openalex-snapshot
Multicommodity Flow Algorithms
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1080/23249935.2017.1352626openalex-snapshot
Minimum cost flow problem formulation for the static vehicle allocation problem with stochastic lane demand in truckload strategic planning
inferred← citeshttps://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferred← citeshttps://doi.org/10.1137/151002915openalex-snapshot
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
inferred← citeshttps://doi.org/10.1137/s0097539792231179openalex-snapshot
Scaling Algorithms for the Shortest Paths Problem
inferred← citeshttps://doi.org/10.1137/s1052623495285886openalex-snapshot
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
inferred← citeshttps://doi.org/10.1145/28395.28397openalex-snapshot
Solving minimum-cost flow problems by successive approximation
inferred← citeshttps://doi.org/10.1145/62212.62249openalex-snapshot
A faster strongly polynomial minimum cost flow algorithm
inferred← citeshttps://doi.org/10.1145/62212.62250openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferred← citeshttps://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferred← citeshttps://doi.org/10.1175/jpo-d-16-0074.1openalex-snapshot
On the Minimum Potential Energy State and the Eddy Size–Constrained APE Density
inferred← citeshttps://doi.org/10.1287/ijoc.8.3.318openalex-snapshot
Use of Representative Operation Counts in Computational Testing of Algorithms
inferred← citeshttps://doi.org/10.1287/moor.16.2.272openalex-snapshot
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
inferred← citeshttps://doi.org/10.1287/moor.22.1.90openalex-snapshot
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
inferred← citeshttps://doi.org/10.1287/opre.41.2.338openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferred← citeshttps://doi.org/10.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.21236/ada457044openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.406openalex-snapshot
Minimum Cost Flows in Graphs with Unit Capacities
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6381openalex-snapshot
Efficient implementations of minimum-cost flow algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1306.6728openalex-snapshot
Min-Cost Flow Duality in Planar Networks
inferred← citeshttps://doi.org/10.5555/313559.313756openalex-snapshot
Scaling algorithms for the shortest paths problem
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.