Online and offline algorithms for the time-dependent TSP with time zones
From MaRDI portal
Publication:1882408
DOI10.1007/s00453-004-1088-zzbMath1134.90514OpenAlexW2004604480MaRDI QIDQ1882408
Björn Brodén, Bengt J. Nilsson, Mikael Hammar
Publication date: 1 October 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2043/11287
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (7)
On temporal graph exploration ⋮ Non-strict Temporal Exploration ⋮ Unnamed Item ⋮ Parameterised temporal exploration problems ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Unnamed Item
This page was built for publication: Online and offline algorithms for the time-dependent TSP with time zones
