Algorithms for the ridesharing with profit constraint problem
From MaRDI portal
Publication:6606199
DOI10.1007/978-3-031-49611-0_26MaRDI QIDQ6606199
Jiajian Leo Liang, Qian-Ping Gu
Publication date: 16 September 2024
network flowcomputational studygraph matchingexact and approximation algorithmsridesharing with profit
Cites Work
- Orienteering problem: a survey of recent variants, solution approaches and applications
- On the complexity of approximating \(k\)-set packing
- Greedy Local Improvement and Weighted Set Packing Approximation
- Approximating the $$k$$-Set Packing Problem by Local Improvements
- Dynamic pricing and matching in ride‐hailing platforms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for the ridesharing with profit constraint problem