New Bounds for Maximizing Revenue in Online Dial-a-Ride
From MaRDI portal
Publication:5041189
DOI10.1007/978-3-030-48966-3_14OpenAlexW3029472009MaRDI QIDQ5041189FDOQ5041189
Authors: Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Algorithms for the on-line travelling salesman
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Typology and literature review for dial-a-ride problems
- On-line single-server dial-a-ride problems
- Tight bounds for online TSP on the line
- Online travelling salesman problem on a circle
- Online Vehicle Routing Problems: A Survey
- Approximation and Online Algorithms
- Maximizing Revenues for On-Line Dial-a-Ride
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
Cited In (7)
- B2C online ride-hailing pricing and service optimization under competitions
- Revenue maximization in online dial-a-ride
- Maximizing Revenues for On-Line Dial-a-Ride
- Title not available (Why is that?)
- Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
- Improved bounds for open online dial-a-ride on the line
- Improved bounds for revenue maximization in time-limited online dial-a-ride
This page was built for publication: New Bounds for Maximizing Revenue in Online Dial-a-Ride
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041189)
