Improved bounds for revenue maximization in time-limited online dial-a-ride

DOI10.1007/s43069-021-00076-xzbMath1468.90030OpenAlexW3192971731MaRDI QIDQ1981946

Ananya D. Christman, Christine Chung, Xinyue Xu, David S. Yuen, Tianzhi Li, Scott Westvold, Nicholas Jaczko

Publication date: 7 September 2021

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-021-00076-x

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• The online prize-collecting traveling salesman problem
• Typology and literature review for dial-a-ride problems
• From theory to practice: maximizing revenues for on-line dial-a-ride
• Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
• Online Vehicle Routing Problems: A Survey
• The prize collecting traveling salesman problem
• Tight Bounds for Online TSP on the Line
• New Bounds for Maximizing Revenue in Online Dial-a-Ride
• Approximation and Online Algorithms
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems

This page was built for publication: Improved bounds for revenue maximization in time-limited online dial-a-ride