Linear Network Optimization¶
Bertsekas, D. P. (2003). Linear Network Optimization: Algorithms and Codes. MIT Press.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Mathematical Flow Graph
- The same test distinguishes the node from Network Flow Models, where edge variables are quantities routed subject to conservation and capacity.
This sourceAuthoritative treatment of shortest-path, max-flow, assignment, transportation, and minimum-cost flow models, used to fix the optimization-network boundary.
- The same test distinguishes the node from Network Flow Models, where edge variables are quantities routed subject to conservation and capacity.
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:643a6f2b5ab4 · see in the full table