Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
From MaRDI portal
Publication:3392205
DOI10.1287/OPRE.1070.0450zbMATH Open1167.90381OpenAlexW2159448554MaRDI QIDQ3392205FDOQ3392205
Authors: Patrick Jaillet, Michael R. Wagner 
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1f95144c343fdad677458df349054063df060594
Recommendations
Cited In (28)
- Tight analysis of the lazy algorithm for open online dial-a-ride
- Online traveling salesman problems with service flexibility
- Pricing and allocation algorithm designs in dynamic ridesharing system
- Online Vehicle Routing Problems: A Survey
- Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
- The Steiner traveling salesman problem with online edge blockages
- Optimal routing for electric vehicle service systems
- Online machine minimization with lookahead
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Online algorithms for ambulance routing in disaster response with time-varying victim conditions
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- An improved algorithm for open online dial-a-ride
- The Canadian tour operator problem on paths: tight bounds and resource augmentation
- New Bounds for Maximizing Revenue in Online Dial-a-Ride
- Title not available (Why is that?)
- Approximating the Canadian traveller problem with online randomization
- Online routing and searching on graphs with blocked edges
- Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements
- An online optimization approach for post-disaster relief distribution with online blocked edges
- Online traveling salesman problem with deadlines and service flexibility
- Online routing for smart electricity network under hybrid uncertainty
- From theory to practice: maximizing revenues for on-line dial-a-ride
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- Improved bounds for open online dial-a-ride on the line
- The covering Canadian traveller problem
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- The post-disaster debris clearance problem under incomplete information
This page was built for publication: Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392205)
