1 citations · 2 across the 5 of their papers we have counts for
Showing 2024 · math.OCShow all
2 papers · 2 filters
math.OC2024★ 1 cited
Average Distance of Random Bipartite Matching in One-dimensional Space and Networks
Yuhui Zhai, Shiyu Shen, Yanfeng Ouyang
The bipartite matching problem is widely applied in the field of transportation; e.g., to find optimal matches between supply and demand over time and space. Recent efforts have be…
math.OC2024★ 1 cited
Expected Optimal Distances of Random Bipartite Matching in -dimensional Spaces: Approximate Formulas and Applications to Mobility Services
Shiyu Shen, Yuhui Zhai, Yanfeng Ouyang
Although many well-known algorithms can solve each bipartite matching problem instance efficiently, it remains an open question how one could estimate the expected optimal matching…