Algorithmic analysis for ridesharing of personal vehicles
From MaRDI portal
Publication:1630989
DOI10.1016/J.TCS.2017.08.019zbMath1407.68222OpenAlexW2752899829MaRDI QIDQ1630989
Jiajian Leo Liang, Qian-Ping Gu, Guo-Chuan Zhang
Publication date: 5 December 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.08.019
Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Models and linearizations for the Traveling Car Renter with passengers ⋮ Efficient algorithms for ridesharing of personal vehicles ⋮ Approximate ridesharing of personal vehicles problem
Cites Work
- Unnamed Item
- The \(k\)-track assignment problem
- Optimization for dynamic ride-sharing: a review
- The dial-a-ride problem: Models and algorithms
- Algorithmic Analysis for Ridesharing of Personal Vehicles
- Interval scheduling: A survey
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
This page was built for publication: Algorithmic analysis for ridesharing of personal vehicles