Online and Offline Algorithms for the Time-Dependent TSP with Time Zones

DSpace Repository

Online and Offline Algorithms for the Time-Dependent TSP with Time Zones

Details

Files for download Overview of item record
Publication Article, peer reviewed scientific
Title Online and Offline Algorithms for the Time-Dependent TSP with Time Zones
Author Brodén, Björn ; Hammar, Mikael ; Nilsson, Bengt J
Date 2004
English abstract
The time dependent traveling salesman problem is a variant of TSP with time dependent edge costs. We study some restrictions of TDTSP where the number of edge cost changes are limited. We find competitive ratios for online versions of \tdtsp. From these we derive polynomial time approximation algorithms for graphs with edge costs one and two. In addition, we present an approximation algorithm for the orienteering problem with edge costs one and two.
DOI https://doi.org/10.1007/s00453-004-1088-z (link to publisher's fulltext.)
Publisher Springer
Host/Issue Algorithmica;4
Volume 39
ISSN 0178-4617
Pages 299-319
Language eng (iso)
Subject Sciences
Research Subject Categories::MATHEMATICS::Applied mathematics::Theoretical computer science
Research Subject Categories::TECHNOLOGY::Information technology::Computer science::Computer science
Handle http://hdl.handle.net/2043/11287 Permalink to this page
Facebook

This item appears in the following Collection(s)

Details

Search


Browse

My Account

Statistics