Online stochastic weighted matching algorithm for real‐time shared parking
From MaRDI portal
Publication:6080597
DOI10.1111/itor.13184OpenAlexW4289866291MaRDI QIDQ6080597
Yan-Ping Jiang, Feifei Yang, Zhenpeng Tang
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13184
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal deterministic algorithm for online \(b\)-matching
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- An advanced parking navigation system for downtown parking
- Online Stochastic Matching: Online Actions Based on Offline Statistics
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- Online Stochastic Weighted Matching: Improved Approximation Algorithms
- Online Stochastic Matching: Beating 1-1/e
- Online Stochastic Matching: New Algorithms with Better Bounds
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
This page was built for publication: Online stochastic weighted matching algorithm for real‐time shared parking