Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem¶
Tarjan, R. E. (1991). Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem. Mathematics of Operations Research.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Simplex pivot rule
- Bland's theorem proves finiteness for his stated Rule I, not for every choice rule; Tarjan's publisher abstract gives a polynomial result only for a restricted planar network case, not all LPs.
This sourceFull article was not directly inspected.
- Bland's theorem proves finiteness for his stated Rule I, not for every choice rule; Tarjan's publisher abstract gives a polynomial result only for a restricted planar network case, not all LPs.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:8b07c7d4fb8d · see in the full table