AA3 – Next Generation Networks



Efficient Algorithms for Quickest Transshipment Problems

Project Heads

Martin Skutella

Project Members

Lizaveta Manzhulina

Project Duration

01.01.2024 – 31.12.2025

Located at

TU Berlin


The Quickest Transshipment Problem is to route flow as quickly as possible from sources with supplies to sinks with demands in a network with capacities and transit times on the arcs. It is of fundamental importance for numerous applications in areas such as logistics, traffic, evacuation, and finance. This project aims at a better structural understanding of quickest transshipments leading to practically efficient algorithms that can find optimal or near-optimal solutions in large-scale traffic networks. The main mathematical challenge is to find more efficient ways to deal with the underlying submodular functions whose repeated minimization constitutes the main bottleneck of known algorithmic approaches.

Project Webpages

Selected Publications

Selected Pictures

Please insert any kind of pictures (photos, diagramms, simulations, graphics) related to the project in the above right field (Image with Text), by choosing the green plus image on top of the text editor. (You will be directed to the media library where you can add new files.)
(We need pictures for a lot of purposes in different contexts, like posters, scientific reports, flyers, website,…
Please upload pictures that might be just nice to look at, illustrate, explain or summarize your work.)

As Title in the above form please add a copyright.

And please give a short description of the picture and the context in the above textbox.

Don’t forget to press the “Save changes” button at the bottom of the box.

If you want to add more pictures, please use the “clone”-button at the right top of the above grey box.