ConceptEngineering
Dual decomposition network flow algorithm
An algorithm that iteratively determines link flows from potential differences, computes node flow surpluses, and updates node potentials to solve network flow problems.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.