On the public citation graph
A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
0 signed · 53 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/bf01580132openalex-snapshot
A bad network problem for the simplex method and other minimum cost flow algorithms
inferredcites →https://doi.org/10.1007/bf01593804openalex-snapshot
A practicable steepest-edge simplex algorithm
inferredcites →https://doi.org/10.1007/bf02288321openalex-snapshot
A computational comparison of the dinic and network simplex methods for maximum flow
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
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.62250openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1287/opre.37.5.748openalex-snapshot
A Fast and Simple Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.21236/ada214691openalex-snapshot
Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.2307/1907816openalex-snapshot
Activity Analysis of Production and Allocation
inferredcites →https://doi.org/10.4153/cjm-1957-024-0openalex-snapshot
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.1012openalex-snapshot
A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs
inferred← citeshttps://doi.org/10.1002/net.22082openalex-snapshot
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_25openalex-snapshot
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_476openalex-snapshot
Optimization in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-1-4612-2666-6_17openalex-snapshot
Finding the Most Vital Arc in the Shortest Path Problem with Fuzzy Arc Lengths
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_11openalex-snapshot
The Network Simplex Algorithm
inferred← citeshttps://doi.org/10.1007/978-94-015-8330-5_2openalex-snapshot
On the Complexity of the Simplex Method
inferred← citeshttps://doi.org/10.1007/bf01580604openalex-snapshot
A polynomial-time simplex method for the maximumk-flow problem
inferred← citeshttps://doi.org/10.1007/bf01580615openalex-snapshot
Polynomial dual network simplex algorithms
inferred← citeshttps://doi.org/10.1007/bf01582129openalex-snapshot
Strongly polynomial dual simplex methods for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/bf01594940openalex-snapshot
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/bf01758840openalex-snapshot
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.1007/bf02614365openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.1007/bf02614368openalex-snapshot
On strongly polynomial dual simplex algorithms for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/bf02614369openalex-snapshot
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
inferred← citeshttps://doi.org/10.1007/s10479-014-1769-1openalex-snapshot
Exterior point simplex-type algorithms for linear and network optimization problems
inferred← citeshttps://doi.org/10.1007/s11227-020-03227-9openalex-snapshot
Multi-granularity hybrid parallel network simplex algorithm for minimum-cost flow problems
inferred← citeshttps://doi.org/10.1007/s11590-006-0016-3openalex-snapshot
Maximum flow problem in wireless ad hoc networks with directional antennas
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90148-hopenalex-snapshot
On the maximum capacity augmentation algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90039-ropenalex-snapshot
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90060-9openalex-snapshot
The maximum flow problem: A max-preflow approach
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.026openalex-snapshot
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
inferred← citeshttps://doi.org/10.1016/j.orl.2007.12.001openalex-snapshot
A strongly polynomial simplex method for the linear fractional assignment problem
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00052-1openalex-snapshot
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00269-xopenalex-snapshot
Computational investigations of maximum flow algorithms
inferred← citeshttps://doi.org/10.1080/02331934.2013.800515openalex-snapshot
On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1109/cit.2011.25openalex-snapshot
Fast Augmentation Algorithms for Maximising the Flow in Repairable Flow Networks After a Component Failure
inferred← citeshttps://doi.org/10.1109/cvpr.2015.7298645openalex-snapshot
Graph-based simplex method for pairwise energy minimization with binary variables
inferred← citeshttps://doi.org/10.1109/jproc.1993.752029openalex-snapshot
Intelligent optical networks: research, education, and industrial programs at the center for telecommunications research
inferred← citeshttps://doi.org/10.1137/18m1197205openalex-snapshot
A Friendly Smoothed Analysis of the Simplex Method
inferred← citeshttps://doi.org/10.1145/3188745.3188826openalex-snapshot
A friendly smoothed analysis of the simplex method
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.21236/ada214691openalex-snapshot
Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.21236/ada254340openalex-snapshot
Polynomial Dual Network Simplex Algorithms
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2008.00143openalex-snapshot
New algorithm for maximum flow algorithm in network with both node and edge capacity confined
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3858openalex-snapshot
Bottleneck flows in networks
inferred← citeshttps://doi.org/10.5555/313852.314105openalex-snapshot
A polynomial time primal network simplex algorithm for minimum 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.