On the public citation graph
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
0 signed · 54 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.1002/net.3230080405openalex-snapshot
Primal simplex network codes: State‐of‐the‐art implementation technology
inferredcites →https://doi.org/10.1002/net.3230090304openalex-snapshot
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
inferredcites →https://doi.org/10.1002/net.3230110406openalex-snapshot
A dual simplex algorithm for finding all shortest paths
inferredcites →https://doi.org/10.1007/bf01580869openalex-snapshot
A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
inferredcites →https://doi.org/10.1007/bf01582238openalex-snapshot
Efficient dual simplex algorithms for the assignment problem
inferredcites →https://doi.org/10.1007/bf01582245openalex-snapshot
Efficient dual simplex algorithms for the assignment problem
inferredcites →https://doi.org/10.1007/bf01594940openalex-snapshot
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
inferredcites →https://doi.org/10.1007/bf01917108openalex-snapshot
The Average number of pivot steps required by the Simplex-Method is polynomial
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02591902openalex-snapshot
On the average number of steps of the simplex method of linear programming
inferredcites →https://doi.org/10.1007/bfb0121050openalex-snapshot
On the simplex algorithm for networks and generalized networks
inferredcites →https://doi.org/10.1007/bfb0121089openalex-snapshot
An efficient implementation of the network simplex method
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(81)90026-3openalex-snapshot
Parametric shortest path algorithms with an application to cyclic staffing
inferredcites →https://doi.org/10.1016/0166-218x(93)90054-ropenalex-snapshot
A genuinely polynomial primal simplex algorithm for the assignment problem
inferredcites →https://doi.org/10.1016/s0167-5060(08)70830-6openalex-snapshot
Shortest Path and Network Flow Algorithms
inferredcites →https://doi.org/10.1057/jors.1981.67openalex-snapshot
Discrete Structures and Algorithms
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.1287/moor.16.2.272openalex-snapshot
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
inferredcites →https://doi.org/10.1287/moor.4.2.196openalex-snapshot
Theoretical Properties of the Network Simplex Method
inferredcites →https://doi.org/10.1287/opre.31.3.595openalex-snapshot
Technical Note—A Polynomial Simplex Method for the Assignment Problem
inferredcites →https://doi.org/10.1287/opre.33.3.527openalex-snapshot
Signature Methods for the Assignment Problem
inferredcites →https://doi.org/10.1287/opre.38.4.624openalex-snapshot
Efficient Shortest Path Simplex Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
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/bf02614365openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.1007/bf02614367openalex-snapshot
A new pivot selection rule for the network simplex algorithm
inferred← citeshttps://doi.org/10.1007/s10107-017-1223-7openalex-snapshot
Convexification of generalized network flow problem
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90088-kopenalex-snapshot
An O(n) bound for the diameter of transshipment polytopes
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/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1109/cdc.2013.6761089openalex-snapshot
Convexification of Generalized Network Flow problem with application to power systems
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402434openalex-snapshot
Convex analysis of generalized flow networks
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.1365/s13291-010-0001-8openalex-snapshot
An Update on the Hirsch Conjecture
inferred← citeshttps://doi.org/10.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.5555/313852.314105openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.7907/e750-2m74.openalex-snapshot
Mathematical study of complex networks: brain, internet, and power grid
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.