Optimal deterministic algorithms for some variants of online quota traveling salesman problem

DOI10.1016/J.EJOR.2014.04.037zbMATH Open1338.90359OpenAlexW2103307401MaRDI QIDQ296870FDOQ296870

Authors: Wei Yu, Zhaohui Liu, Xiaoguang Bao 

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.037

Recommendations

• Computing and Combinatorics
• Algorithms for the on-line quota traveling salesman problem
• Algorithms for the on-line travelling salesman
• Algorithms and Data Structures
• Competitive algorithms for the on-line traveling salesman

zbMATH Keywords

competitive ratioonline algorithmquota TSPtraveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Title not available (Why is that?)
• The orienteering problem: a survey
• Online algorithms. The state of the art
• Title not available (Why is that?)
• The online TSP against fair adversaries
• Title not available (Why is that?)
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
• Title not available (Why is that?)
• Algorithms for the on-line travelling salesman
• Algorithms for the on-line quota traveling salesman problem
• The on-line asymmetric traveling salesman problem
• The online prize-collecting traveling salesman problem
• An adversarial queueing model for online server routing

Cited In (4)

• A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
• Algorithms for the on-line quota traveling salesman problem
• Computing and Combinatorics
• Online traveling salesman problem with time cost and non-zealous server

This page was built for publication: Optimal deterministic algorithms for some variants of online quota traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296870)