1 citations · 2 across the 5 of their papers we have counts for
5 papers
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-…
Developing Fundamental Diagrams for Urban Air Mobility Traffic Based on Physical Experiments
Hang Zhou, Yuhui Zhai, Shiyu Shen +3
Urban Air Mobility (UAM) is an emerging application of unmanned aerial vehicles that promises to reduce travel time and alleviate congestion in urban transportation systems. As dro…
Dynamic Random Bipartite Matching under Spatiotemporal Heterogeneity: General Models and Application to Mobility Services
Shiyu Shen, Yanfeng Ouyang
This paper explores a variant of bipartite matching problem, referred to as the Spatiotemporal Random Bipartite Matching Problem (ST-RBMP), that accommodates randomness and heterog…
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…
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…