Lecture Notes for IEOR 266: Graph Algorithms and Network Flows¶
Hochbaum, D. S. (. (2019). Lecture Notes for IEOR 266: Graph Algorithms and Network Flows: Graph Algorithms and Network Flows.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Network Simplex Algorithm
- This is more precise than saying that every nonbasic arc is zero; upper-bound nonbasic arcs are essential in capacitated formulations.
This sourceGives the bounded minimum-cost-flow formulation, $(T,L,U)$ structure, tree-basis correspondence, optimality conditions, and cycle-canceling comparison.
- This is more precise than saying that every nonbasic arc is zero; upper-bound nonbasic arcs are essential in capacitated formulations.
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:27bdf7f8031b · see in the full table