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¶
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:643a6f2b5ab4 · see in the full table