Efficient algorithms for ridesharing of personal vehicles

DOI10.1016/j.tcs.2019.05.027zbMath1433.90135OpenAlexW2955827721WikidataQ127566702 ScholiaQ127566702MaRDI QIDQ5919566

Qian-Ping Gu, Jiajian Leo Liang, Guo-Chuan Zhang

Publication date: 9 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.027

zbMATH Keywords

optimization problemspolynomial-time algorithmsridesharing problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

Approximate ridesharing of personal vehicles problem

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic analysis for ridesharing of personal vehicles
• A distributed geographic information system for the daily car pooling problem
• Optimization for dynamic ride-sharing: a review
• The Mixed Evacuation Problem
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
• Efficient algorithms for ridesharing of personal vehicles

This page was built for publication: Efficient algorithms for ridesharing of personal vehicles