On the public citation graph
A new strongly polynomial dual network simplex algorithm
0 signed · 39 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.3230210203openalex-snapshot
Maximum matchings in bipartite graphs via strong spanning trees
inferredcites →https://doi.org/10.1007/bf01580579openalex-snapshot
A competitive (dual) simplex method for the assignment problem
inferredcites →https://doi.org/10.1007/bf01580615openalex-snapshot
Polynomial dual network simplex algorithms
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/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1016/0166-218x(94)00122-topenalex-snapshot
Strongly polynomial simplex algorithm for bipartite vertex packing
inferredcites →https://doi.org/10.1016/0167-6377(92)90103-aopenalex-snapshot
Solving linear bottleneck assignment problems via strong spanning trees
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1287/opre.41.2.338openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferredcites →https://doi.org/10.21236/ada254340openalex-snapshot
Polynomial Dual Network Simplex Algorithms
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_21openalex-snapshot
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_9openalex-snapshot
Flüsse mit minimalen Kosten
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_9openalex-snapshot
Flüsse mit minimalen Kosten
inferred← citeshttps://doi.org/10.1007/s001860200202openalex-snapshot
On dual minimum cost flow algorithms
inferred← citeshttps://doi.org/10.1007/s101070100248openalex-snapshot
A polynomial dual simplex algorithm for the generalized circulation problem
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.1051/ro/2016033openalex-snapshot
Capacitated two-stage time minimization transportation problem with restricted flow
inferred← citeshttps://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1093/logcom/exab072openalex-snapshot
Read-once refutations in Horn constraint systems: an algorithmic approach
inferred← citeshttps://doi.org/10.1109/tvt.2015.2410798openalex-snapshot
Variable-Bit-Rate Transmission Schedule Generation in Green Vehicular Roadside Units
inferred← citeshttps://doi.org/10.1145/335305.335319openalex-snapshot
On dual minimum cost flow algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1145/338407.338537openalex-snapshot
Parallel algorithm for the routing problem
inferred← citeshttps://doi.org/10.11606/d.55.2018.tde-06032018-104542openalex-snapshot
Implementação do Algoritmo Paralelo para o Problema de Roteamento de Dados no Computador Paralelo IBM-SP2
inferred← citeshttps://doi.org/10.1287/ijoc.1110.0485openalex-snapshot
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0642openalex-snapshot
Iterated Inside Out: A New Exact Algorithm for the Transportation Problem
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.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.15807/jorsj.43.149openalex-snapshot
ON NETWORK SIMPLEX METHOD USING THE PRIMAL-DUAL SYMMETRIC PIVOTING RULE
inferred← citeshttps://doi.org/10.15807/jorsj.47.244openalex-snapshot
A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS( Network Design, Control and Optimization)
inferred← citeshttps://doi.org/10.3934/jimo.2020102openalex-snapshot
Dynamic network flow location models and algorithms for quickest evacuation planning
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.