Approximate ridesharing of personal vehicles problem

DOI10.1016/J.TCS.2021.04.009zbMath1483.90055arXiv2007.15154OpenAlexW3045563505MaRDI QIDQ5918279

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

Publication date: 8 June 2021

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

Full work available at URL: https://arxiv.org/abs/2007.15154

zbMATH Keywords

optimization problemsapproximation algorithmsalgorithmic analysisridesharing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Uses Software

• PoliUniPool

Cites Work

• Unnamed Item
• Algorithmic analysis for ridesharing of personal vehicles
• Enhancing urban mobility: integrating ride-sharing and public transit
• Typology and literature review for dial-a-ride problems
• Optimization for dynamic ride-sharing: a review
• Efficient algorithms for ridesharing of personal vehicles
• Approximate ridesharing of personal vehicles problem

This page was built for publication: Approximate ridesharing of personal vehicles problem