Network Flows

Ahuja, R. K., Magnanti, & Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.

Type

Book

Intellectual base

Textbook

Year

1993

Link

https://www.pearson.com/en-us/subject-catalog/p/Ahuja-Network-Flows-Theory-Algorithms-and-Applications/P200000003456/9780136175490

Cited from

operations_research

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Network Flow Models
  • The tooling ecosystem is broad: network-flow algorithms in general-purpose LP solvers (CPLEX, Gurobi, HiGHS, all with network-flow specializations); specialized libraries (LEMON graph library in C++; NetworkX and OR-Tools in Python; JuliaGraphs ecosystem); graph-database and graph-processing frameworks (Neo4j for storage with graph-algorithm libraries; Apache Giraph, Spark GraphX for distributed graph processing); and mature academic references (Ahuja, Magnanti, and Orlin (1993) as the canonical network-flow textbook; Goldberg-Tarjan and others for algorithm-specific literature).

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 sourceChapter 11 treats network-simplex algorithms, tree solutions, potentials, pivot rules, sensitivity, and their relationship to general simplex.

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:09792d02e2bb · see in the full table