MATH 3802: Network Simplex Method¶
K., C. MATH 3802: Network Simplex Method: Network Simplex Method.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Network Simplex Algorithm
- If no bound-fixed arc has an improving reduced-cost sign, the current feasible flow satisfies the primal-dual optimality conditions.
This sourceGives the tree-solution algorithm, potentials, entering and leaving arcs, worked cycle pivots, reduced-cost stopping condition, and assignment reduction.
- If no bound-fixed arc has an improving reduced-cost sign, the current feasible flow satisfies the primal-dual optimality conditions.
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:6a66e6b7f6e4 · see in the full table