Online traveling salesman problem with time cost and non-zealous server

DOI10.1007/s10878-020-00585-1zbMath1502.90159OpenAlexW3030609093MaRDI QIDQ2082223

Tengyu Wu, Lin He, Hai-Yan Yu

Publication date: 4 October 2022

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

Full work available at URL: https://doi.org/10.1007/s10878-020-00585-1

zbMATH Keywords

traveling salesman problemonline algorithmemergency vehicle routingper-unit-time cost

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Optimal deterministic algorithms for some variants of online quota traveling salesman problem
• Online traveling salesman problem with deadlines and service flexibility
• Manufacturing lead-time rules: customer retention versus tardiness costs
• On the power of lookahead in on-line server routing problems
• The online prize-collecting traveling salesman problem
• News from the online traveling repairman.
• On-line algorithms for the dynamic traveling repair problem
• How to whack moles
• The Online TSP Against Fair Adversaries
• Online traveling salesman problems with service flexibility
• On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis

This page was built for publication: Online traveling salesman problem with time cost and non-zealous server