On the public citation graph
The Simplex Algorithm Is NP-Mighty
0 signed · 41 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/978-3-540-76796-1openalex-snapshot
Research Trends in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-540-76796-1_21openalex-snapshot
An Introduction to Network Flows over Time
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/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02614365openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/s0022-0000(05)80063-7openalex-snapshot
On the complexity of the parity argument and other inefficient proofs of existence
inferredcites →https://doi.org/10.1145/100216.100274openalex-snapshot
On the complexity of local search
inferredcites →https://doi.org/10.1145/2465769.2465774openalex-snapshot
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
inferredcites →https://doi.org/10.1145/2746539.2746558openalex-snapshot
The Complexity of the Simplex Method
inferredcites →https://doi.org/10.1145/990308.990310openalex-snapshot
Smoothed analysis of algorithms
inferredcites →https://doi.org/10.1287/mnsc.28.1.106openalex-snapshot
Note—Some Equivalent Objectives for Dynamic Network Flow Problems
inferredcites →https://doi.org/10.1287/opre.19.7.1602openalex-snapshot
An Algorithm for Universal Maximal Dynamic Flows in a Network
inferredcites →https://doi.org/10.1287/opre.21.2.517openalex-snapshot
Maximal, Lexicographic, and Dynamic Network Flows
inferredcites →https://doi.org/10.21236/ad0249662openalex-snapshot
A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS
inferredcites →https://doi.org/10.4230/lipics.esa.2016.78openalex-snapshot
The Complexity of the k-means Method
inferredcites →https://doi.org/10.48550/arxiv.1404.3320openalex-snapshot
On Simplex Pivoting Rules and Complexity Theory
inferredcites →https://doi.org/10.5555/2722129.2722188openalex-snapshot
The simplex algorithm is NP-mighty
inferredcites →https://doi.org/10.5555/2884435.2884445openalex-snapshot
The complexity of all-switches strategy improvement
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6659openalex-snapshot
Parallel network simplex algorithm for the minimum cost flow problem
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_6openalex-snapshot
Inapproximability of Shortest Paths on Perfect Matching Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_16openalex-snapshot
An Unconditional Lower Bound for the Active-Set Method on the Hypercube
inferred← citeshttps://doi.org/10.1007/s10107-023-02025-4openalex-snapshot
Inapproximability of shortest paths on perfect matching polytopes
inferred← citeshttps://doi.org/10.1017/9781009490559.009openalex-snapshot
An Introduction to Transshipments Over Time
inferred← citeshttps://doi.org/10.1017/9781108637435.019openalex-snapshot
Smoothed Analysis of the Simplex Method
inferred← citeshttps://doi.org/10.1109/osmses54027.2022.9769166openalex-snapshot
Abandoning the Residual Load Duration Curve and Overcoming the Computational Challenge
inferred← citeshttps://doi.org/10.1109/tnnls.2025.3601130openalex-snapshot
Robust Missing Value Imputation With Proximal Optimal Transport for Low-Quality IIoT Data
inferred← citeshttps://doi.org/10.1145/3568163openalex-snapshot
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
inferred← citeshttps://doi.org/10.1145/3725731openalex-snapshot
Debiased Recommendation via Wasserstein Causal Balancing
inferred← citeshttps://doi.org/10.3390/math10050803openalex-snapshot
Machining Parameters Optimization Based on Objective Function Linearization
inferred← citeshttps://doi.org/10.48550/arxiv.2010.02184openalex-snapshot
Multi-Commodity Nash Flows Over Time
inferred← citeshttps://doi.org/10.5772/intechopen.91624openalex-snapshot
Homology Molecular Modeling - Perspectives and Applications
inferred← citeshttps://doi.org/10.70675/704f2b7czeefbz426bz9168z1bf608d808c4openalex-snapshot
Methodology for code-optimization of memory data layouts by adaptation to high-performance-system architectures with complex memory hierarchies
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.