On the public citation graph
Polynomial dual network simplex algorithms
0 signed · 57 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.3230090304openalex-snapshot
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
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/bf01594940openalex-snapshot
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
inferredcites →https://doi.org/10.1007/bfb0121050openalex-snapshot
On the simplex algorithm for networks and generalized networks
inferredcites →https://doi.org/10.1145/62212.62249openalex-snapshot
A faster strongly polynomial minimum cost flow algorithm
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.33.3.527openalex-snapshot
Signature Methods for the Assignment Problem
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-540-76919-4_9openalex-snapshot
Flüsse mit minimalen Kosten
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/978-94-015-8330-5_2openalex-snapshot
On the Complexity of the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-981-13-3059-9_5openalex-snapshot
Symmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/bf01582129openalex-snapshot
Strongly polynomial dual simplex methods for the maximum 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/bf02614366openalex-snapshot
A new strongly polynomial dual 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/s12597-012-0069-2openalex-snapshot
Flow constrained minimum cost flow problem
inferred← citeshttps://doi.org/10.1016/j.amc.2003.09.028openalex-snapshot
Computational experience with exterior point algorithms for the transportation problem
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.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1103/physrevd.101.034009openalex-snapshot
Exploring the space of jets with CMS open data
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00037openalex-snapshot
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
inferred← citeshttps://doi.org/10.1109/icmlc.2006.258616openalex-snapshot
A Novel Particle Swarm Optimization Algorithm for Solving Transportation Problem
inferred← citeshttps://doi.org/10.1109/qsic.2007.4385480openalex-snapshot
Towards Automatic Measurement of Probabilistic Processes
inferred← citeshttps://doi.org/10.1109/tcyb.2015.2502421openalex-snapshot
Optimal Decision-Making in an Opportunistic Sensing Problem
inferred← citeshttps://doi.org/10.1137/18m1197205openalex-snapshot
A Friendly Smoothed Analysis of the Simplex Method
inferred← citeshttps://doi.org/10.1145/335305.335319openalex-snapshot
On dual minimum cost flow algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1145/3728631openalex-snapshot
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
inferred← citeshttps://doi.org/10.1257/aer.20240712openalex-snapshot
Random Utility with Unobservable Alternatives
inferred← citeshttps://doi.org/10.1287/moor.2021.1140openalex-snapshot
Probability Distributions on Partially Ordered Sets and Network Interdiction Games
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.4028/www.scientific.net/amm.121-126.2288openalex-snapshot
Study on Capacity Expansion Model and Arithmetic of Transportation Network with Distribution Centers
inferred← citeshttps://doi.org/10.5281/zenodo.3341412openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 800-1000 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341413openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 800-1000 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341418openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 470-600 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341419openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 470-600 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341420openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 600-800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341497openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 300-470 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341498openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 300-470 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341499openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 170-300 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341500openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 170-300 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341769openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 1400-1800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3341770openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 1400-1800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.5281/zenodo.3364139openalex-snapshot
CMS 2011A Simulation | Pythia 6 QCD 600-800 | pT > 375 GeV | MOD HDF5 Format
inferred← citeshttps://doi.org/10.70675/1fcd1ce1zc420z4d4cz8af5z266ab03c4ea5openalex-snapshot
Machine Learning Techniques for Online Resource Allocation in Wireless Networks
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.