Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
From MaRDI portal
Publication:3392205
Recommendations
Cited in
(32)- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- 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
- Online routing for smart electricity network under hybrid uncertainty
- Online machine minimization with lookahead
- Online routing and searching on graphs with blocked edges
- Pricing and allocation algorithm designs in dynamic ridesharing system
- The covering Canadian traveller problem
- Approximating the Canadian traveller problem with online randomization
- An online optimization approach for post-disaster relief distribution with online blocked edges
- Improved bounds for open online dial-a-ride on the line
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Online traveling salesman problems with service flexibility
- The Steiner traveling salesman problem with online edge blockages
- The post-disaster debris clearance problem under incomplete information
- Optimal routing for electric vehicle service systems
- The Canadian tour operator problem on paths: tight bounds and resource augmentation
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Online Vehicle Routing Problems: A Survey
- Online traveling salesman problem with deadlines and service flexibility
- New Bounds for Maximizing Revenue in Online Dial-a-Ride
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- scientific article; zbMATH DE number 7650088 (Why is no real title available?)
- Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
- Tight analysis of the lazy algorithm for open online dial-a-ride
- An improved algorithm for open online dial-a-ride
- Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements
- Online algorithms for ambulance routing in disaster response with time-varying victim conditions
- Tight analysis of the lazy algorithm for open online dial-a-ride
- Picking operations in warehouses with dynamically arriving orders: how good is reoptimization?
- Traveling repairperson, unrelated machines, and other stories about average completion times
- Robust competitive ratio for deterministic monopoly pricing
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)
