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
- … time under the paper's parameterization; that result must not be generalized to arbitrary entering-arc rules. 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.
- … time under the paper's parameterization; that result must not be generalized to arbitrary entering-arc rules. 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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:0c38f774cb9c · see in the full table