Lösung großskaliger Minimum-Cost-Network-Flow-Probleme zur Minimierung von Leerfahrten autonomer Taxiflotten mittels Primal-Dual-Algorithmen.
Partitioning the urban map into spatial H3 hexagons allows localized parallel bipartite matching, scaling efficiently to 100,000 requests per minute.