Two short notes on the on-line travelling salesman: handling times and lookahead.

DOI10.1016/S0304-3975(01)00323-1zbMath1061.68186OpenAlexW2079060572MaRDI QIDQ1853561

Peter Damaschke

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00323-1

zbMATH Keywords

LookaheadTravelling salesmanOn-line algorithmsHandling times

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vehicle scheduling on a tree with release and handling times
• A guessing game and randomized online algorithms
• Serving requests with on-line routing
• Algorithms for the on-line travelling salesman

This page was built for publication: Two short notes on the on-line travelling salesman: handling times and lookahead.