Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses

DOI10.1287/opre.1070.0450zbMath1167.90381OpenAlexW2159448554MaRDI QIDQ3392205

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1f95144c343fdad677458df349054063df060594

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (26)

New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ The Steiner traveling salesman problem with online edge blockages ⋮ Optimal routing for electric vehicle service systems ⋮ The Canadian tour operator problem on paths: tight bounds and resource augmentation ⋮ Online scheduling problems with flexible release dates: applications to infrastructure restoration ⋮ Online machine minimization with lookahead ⋮ The Post-Disaster Debris Clearance Problem Under Incomplete Information ⋮ Online routing and searching on graphs with blocked edges ⋮ Approximating the Canadian traveller problem with online randomization ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges ⋮ 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 ⋮ Unnamed Item ⋮ An improved algorithm for open online dial-a-ride ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ 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 ⋮ Online traveling salesman problem with deadlines and service flexibility ⋮ Online Vehicle Routing Problems: A Survey ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ Unnamed Item ⋮ Almost sure asymptotic optimality for online routing and machine scheduling problems ⋮ Pricing and allocation algorithm designs in dynamic ridesharing system ⋮ Online traveling salesman problems with service flexibility ⋮ Online routing for smart electricity network under hybrid uncertainty

This page was built for publication: Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses