Network Flows

Ravindra K. Ahuja, T. L. M., & James B. Orlin, N. F. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.

Type

Book

Intellectual base

Textbook

Year

1993

Link

no authoritative link yet

Cited by

3 citations across 3 artifacts.

Domain-specific

• Closure problem
  • A closure of a directed graph contains every successor of each selected vertex; the maximum-closure problem asks for a closure maximizing the sum of vertex weights.
• Minimum-cost flow problem
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
• Multi-commodity flow problem
  • A multi-commodity flow problem assigns a separate conserved flow to every commodity while constraining the sum of their edge loads by shared capacities and optimizing a declared objective.

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:4a8585ad9493 · see in the full table