Efficient Implementations of Minimum-Cost Flow Algorithms.¶
Király, Z., & Kovács, P. (2012). Efficient Implementations of Minimum-Cost Flow Algorithms.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Network Simplex Algorithm
- Efficient conventional implementations remain important because the method often performs very well empirically on minimum-cost-flow instances even though natural pivot rules can have exponential worst cases.
This sourceCompares network simplex, cost scaling, cycle-canceling, and established codes; documents pricing and implementation choices and instance-dependent practical performance.
- Efficient conventional implementations remain important because the method often performs very well empirically on minimum-cost-flow instances even though natural pivot rules can have exponential worst cases.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
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:0c38f774cb9c · see in the full table