The transhipment problem, The maximum flow problem

Related lectures (28)

Page 2 of 3

Explores techniques to speed up dataflow analyses and discusses the importance of node ordering and post-order traversal.

Explores the assignment problem and its transformation into a transhipment problem, showcasing an example with selling masterpieces to children.

Covers deriving basic linear program representation, finding solutions, and exploring optimality.

Addresses challenges in data cleaning for analysis, proposing optimizations to reduce processing time.

Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.

Explores the performance evaluation and conclusions of electroacoustic absorbers in room modal equalization and optimization.

Explores optimization techniques like Metropolis-Hastings and Simulated Annealing through Markov chains and stationary distributions.

Demonstrates the Ford-Fulkerson algorithm through a step-by-step worked example.

Covers the efficiency of register machines over stack machines, memory organization, and mapping instructions.

Covers single inequality or equality constraints and necessary optimality conditions in optimization problems.