Online traveling salesman problem with deadlines and service flexibility

DOI10.1007/S10878-013-9654-4zbMath1323.90060OpenAlexW2033182962MaRDI QIDQ498429

Xingang Wen, Yin-Feng Xu, Hui-Li Zhang

Publication date: 28 September 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9654-4

zbMATH Keywords

online algorithmstraveling salesman problemdeadlinesservice flexibility

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Online in-time service problem with minimal server assignment ⋮ Online traveling salesman problem with time cost and non-zealous server

Cites Work

• Algorithms for the on-line quota traveling salesman problem
• The online prize-collecting traveling salesman problem
• Competitive snoopy caching
• How to whack moles
• The Online TSP Against Fair Adversaries
• Online traveling salesman problems with service flexibility
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Stochastic scheduling with optimal customer service
• Algorithms for the on-line travelling salesman

This page was built for publication: Online traveling salesman problem with deadlines and service flexibility