New Bounds for Maximizing Revenue in Online Dial-a-Ride
From MaRDI portal
Publication:5041189
Recommendations
Cites work
- scientific article; zbMATH DE number 1629830 (Why is no real title available?)
- Algorithms for the on-line travelling salesman
- Approximation and Online Algorithms
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Maximizing Revenues for On-Line Dial-a-Ride
- On-line single-server dial-a-ride problems
- Online Vehicle Routing Problems: A Survey
- Online travelling salesman problem on a circle
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Tight bounds for online TSP on the line
- Typology and literature review for dial-a-ride problems
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
- scientific article; zbMATH DE number 7650088 (Why is no real title available?)
- 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)