The Steiner traveling salesman problem with online edge blockages
DOI10.1016/J.EJOR.2014.11.013zbMATH Open1346.90794OpenAlexW1986937309MaRDI QIDQ319009FDOQ319009
Authors: Weitian Tong, Huili Zhang, Yinfeng Xu, Guohui Lin 
Publication date: 6 October 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.11.013
Recommendations
Online algorithms; streaming algorithms (68W27) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- A cutting plane procedure for the travelling salesman problem on road networks
- Compact formulations of the Steiner traveling salesman problem and related problems
- The traveling salesman problem on a graph and some related integer polyhedra
- A fundamental problem in vehicle routing
- Title not available (Why is that?)
- The Traveling Salesman Problem with Distances One and Two
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
- A Randomized Rounding Approach to the Traveling Salesman Problem
- Shortest paths without a map
- Design and control of warehouse order picking: a literature review
- A review of dynamic vehicle routing problems
- Approximating Graphic TSP by Matchings
- Algorithms for the on-line travelling salesman
- Title not available (Why is that?)
- A note on the \(k\)-Canadian traveller problem
- The Canadian Traveller Problem and its competitive analysis
- The \(k\)-Canadian travelers problem with communication
- The covering Canadian traveller problem
- Online traveling salesman problems with service flexibility
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Dynamic programming and the graphical traveling salesman problem
Cited In (8)
- Online covering salesman problem
- Weighted online minimum latency problem with edge uncertainty
- The Steiner traveling salesman problem with online advanced edge blockages
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- Online routing and searching on graphs with blocked edges
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
- An online optimization approach for post-disaster relief distribution with online blocked edges
This page was built for publication: The Steiner traveling salesman problem with online edge blockages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319009)
