Network flows

Network flows are a corner stone of combinatorial optimization. They have numerous obvious and unreckoned applications in various areas, such as traffic, telecommunication, logistics, evacuation problems, computer science, medicine etc., as well as a lot of theoretical impact, e.g., for matchings, mesh generation and reductions. Striving for models closer to real world problems has motivated our group to pursue research in two directions: flows over time and k-splittable flows. The former reflects the idea that a flow should indeed traverse the network in time. The latter accounts for the significant requirement of applications that a flow may not be decomposed in an arbitrary number of paths.