Algorithms for the on-line travelling salesman
From MaRDI portal
Publication:5943663
DOI10.1007/s004530010071zbMath0985.68088OpenAlexW2113529358MaRDI QIDQ5943663
Giorgio Ausiello, Maurizio Talamo, Esteban Feuerstein, Leen Stougie, Stefano Leonardi
Publication date: 19 February 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010071
Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Related Items (54)
New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ Algorithms for the on-line quota traveling salesman problem ⋮ Optimal deterministic algorithms for some variants of online quota traveling salesman problem ⋮ Online \(k\)-server routing problems ⋮ A survey on combinatorial optimization in dynamic environments ⋮ The Steiner traveling salesman problem with online edge blockages ⋮ On multi-threaded metrical task systems ⋮ The Steiner traveling salesman problem with online advanced edge blockages ⋮ Orienteering problem with time-windows and updating delay ⋮ A hard dial-a-ride problem that is easy on average ⋮ Online graph exploration: New results on old and new algorithms ⋮ Online Predictions for Online TSP on the Line ⋮ News from the online traveling repairman. ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ Online TSP with known locations ⋮ Unnamed Item ⋮ An improved algorithm for open online dial-a-ride ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ Improved bounds for open online dial-a-ride on the line ⋮ The covering Canadian traveller problem ⋮ Online Scheduling with Increasing Subsequence Serving Constraint ⋮ The on-line asymmetric traveling salesman problem ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ Online traveling salesman problem with deadlines and service flexibility ⋮ Improved bounds for revenue maximization in time-limited online dial-a-ride ⋮ Competitive analysis of a dispatch policy for a dynamic multi-period routing problem ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Recent Developments in Dynamic Vehicle Routing Systems ⋮ Online Vehicle Routing Problems: A Survey ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ On the power of lookahead in on-line server routing problems ⋮ The online prize-collecting traveling salesman problem ⋮ New policies for the dynamic traveling salesman problem ⋮ Online chasing problems for regular polygons ⋮ On-line vertex-covering ⋮ On-line maximum-order induced hereditary subgraph problems ⋮ New lower bounds for online \(k\)-server routing problems ⋮ Unnamed Item ⋮ How to whack moles ⋮ Weighted nearest neighbor algorithms for the graph exploration problem on cycles ⋮ On-line single-server dial-a-ride problems ⋮ Pricing and allocation algorithm designs in dynamic ridesharing system ⋮ The Power of Recourse for Online MST and TSP ⋮ Online decision making and automatic decision model adaptation ⋮ Fleet management for autonomous vehicles using flows in time-expanded networks ⋮ Discrete online TSP ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ Online traveling salesman problems with service flexibility ⋮ On-line models and algorithms for max independent set ⋮ The online food delivery problem on stars ⋮ Routing of platforms in a maritime surface surveillance operation ⋮ Two short notes on the on-line travelling salesman: handling times and lookahead. ⋮ Competitive on-line coverage of grid environments by a mobile robot
This page was built for publication: Algorithms for the on-line travelling salesman
