1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.OC2026
Compressed Traffic Assignment with the Augmented Lagrangian Method
Xuesong Zhou, Peiheng Li, Yajun Liu +2
We consider large-scale traffic assignment problems and develop a path-based compression framework. In particular, we partition paths into major and minor paths according to nomina…
cs.MA2023★ 1 cited
Approximate Multiagent Reinforcement Learning for On-Demand Urban Mobility Problem on a Large Map (extended version)
Daniel Garces, Sushmita Bhattacharya, Dimitri Bertsekas +1
In this paper, we focus on the autonomous multiagent taxi routing problem for a large urban environment where the location and number of future ride requests are unknown a-priori,…
cs.GT2023
New Auction Algorithms for the Assignment Problem and Extensions
Dimitri Bertsekas
We consider the classical linear assignment problem, and we introduce new auction algorithms for its optimal and suboptimal solution. The algorithms are founded on duality theory,…