New Bounds for Maximizing Revenue in Online Dial-a-Ride

DOI10.1007/978-3-030-48966-3_14OpenAlexW3029472009MaRDI QIDQ5041189

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

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Typology and literature review for dial-a-ride problems
• Online travelling salesman problem on a circle
• Maximizing Revenues for On-Line Dial-a-Ride
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Online Vehicle Routing Problems: A Survey
• Tight Bounds for Online TSP on the Line
• 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: New Bounds for Maximizing Revenue in Online Dial-a-Ride