Solving large-scale minimum-cost network flow problems to minimize deadhead kilometers in commercial autonomous taxi deployments using primal-dual algorithms.
Partitioning the urban map into spatial H3 hexagons allows localized parallel bipartite matching, scaling efficiently to 100,000 requests per minute.