Lecture Notes for IEOR 266: Graph Algorithms and Network Flows¶
Hochbaum, D. S. (. (2018/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¶
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:27bdf7f8031b · see in the full table