Online covering salesman problem

DOI10.1007/s10878-017-0227-9zbMath1400.90267OpenAlexW2783063186MaRDI QIDQ1743496

Yin-Feng Xu, Hui-Li Zhang

Publication date: 13 April 2018

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

Full work available at URL: https://doi.org/10.1007/s10878-017-0227-9

zbMATH Keywords

competitive analysiscovering salesman problemrealtime blockageservice cost

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

Online routing and searching on graphs with blocked edges ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges

Cites Work

• Unnamed Item
• The Steiner traveling salesman problem with online edge blockages
• A note on the prize collecting traveling salesman problem
• Shortest paths without a map
• On the complexity of approximating TSP with neighborhoods and related problems
• The selective travelling salesman problem
• A note on the \(k\)-Canadian traveller problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• The traveling salesman problem and its variations
• The multi-vehicle cumulative covering tour problem
• The bi-objective stochastic covering tour problem
• Heuristics for the multi-vehicle covering tour problem
• Worst-case analysis of a new heuristic for the travelling salesman problem
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• The \(k\)-Canadian travelers problem with communication
• The covering Canadian traveller problem
• The Generalized Covering Salesman Problem
• An improved LP-based approximation for steiner tree
• Heuristic analysis, linear programming and branch and bound
• The Covering Tour Problem
• The Covering Salesman Problem
• A General Approximation Technique for Constrained Forest Problems

This page was built for publication: Online covering salesman problem