Online covering salesman problem

DOI10.1007/S10878-017-0227-9MaRDI QIDQ1743496zbMATH OpenOpenAlexFDO

Authors Huili Zhang, Yinfeng Xu

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)

Recommendations

• The Steiner traveling salesman problem with online edge blockages
• The generalized covering salesman problem
• The \(m\)-Steiner traveling salesman problem with online edge blockages
• The Covering Salesman Problem
• The covering Canadian traveller problem

Cites work

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

Cited in

(8)

• The generalized covering salesman problem
• The Covering Salesman Problem
• The Steiner traveling salesman problem with online edge blockages
• The Steiner traveling salesman problem with online advanced edge blockages
• The \(m\)-Steiner traveling salesman problem with online edge blockages
• Online routing and searching on graphs with blocked edges
• An online optimization approach for post-disaster relief distribution with online blocked edges
• Traveling salesmen in the presence of competition

This page was built for publication: Online covering salesman problem

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