Combinatorial Optimization and Network Flows

 

Network flow problems are motivated by questions that arise, for example, in transportation and communication networks, productions systems, logistics and evacuation planing. The course gives an introduction into basic and more advanced topics in the area of network flows. We plan to cover the following topics:  
 

* Maximum Flows

* Minimum Cost Flows

* Integrality, Optimality Criteria and Efficient Algorithms

* Multicommodity Flows

* Maximum Flows Over Time

* Earliest Arrival Flows

* NP-hard Variants of Flows Over Time

* Approximation Algorithms