1 citations · 2 across the 4 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2026
Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms
Yuhui Zhai, Yanfeng Ouyang
Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-…
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…