On the public citation graph
The Steiner Traveling Salesman Problem with online edge blockages
0 signed · 45 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.20454openalex-snapshot
Online traveling salesman problems with service flexibility
inferredcites →https://doi.org/10.1002/net.3230040105openalex-snapshot
A fundamental problem in vehicle routing
inferredcites →https://doi.org/10.1007/bf01582008openalex-snapshot
The traveling salesman problem on a graph and some related integer polyhedra
inferredcites →https://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1007/s00493-014-2960-3openalex-snapshot
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
inferredcites →https://doi.org/10.1007/s10878-008-9156-yopenalex-snapshot
The canadian traveller problem and its competitive analysis
inferredcites →https://doi.org/10.1007/s10878-012-9503-xopenalex-snapshot
The k-Canadian Travelers Problem with communication
inferredcites →https://doi.org/10.1007/s43069-021-00101-zopenalex-snapshot
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/0304-3975(91)90263-2openalex-snapshot
Shortest paths without a map
inferredcites →https://doi.org/10.1016/0377-2217(85)90151-1openalex-snapshot
A cutting plane procedure for the travelling salesman problem on road networks
inferredcites →https://doi.org/10.1016/j.ejor.2012.08.015openalex-snapshot
A review of dynamic vehicle routing problems
inferredcites →https://doi.org/10.1016/j.ejor.2013.01.044openalex-snapshot
Compact formulations of the Steiner Traveling Salesman Problem and related problems
inferredcites →https://doi.org/10.1016/j.ipl.2007.10.004openalex-snapshot
A note on the k-Canadian Traveller Problem
inferredcites →https://doi.org/10.1016/j.tcs.2014.02.026openalex-snapshot
The Covering Canadian Traveller Problem
inferredcites →https://doi.org/10.1109/focs.2011.56openalex-snapshot
Approximating Graphic TSP by Matchings
inferredcites →https://doi.org/10.1109/focs.2011.80openalex-snapshot
A Randomized Rounding Approach to the Traveling Salesman Problem
inferredcites →https://doi.org/10.1145/174147.169803openalex-snapshot
Dynamic programming and the graphical traveling salesman problem
inferredcites →https://doi.org/10.1287/moor.18.1.1openalex-snapshot
The Traveling Salesman Problem with Distances One and Two
inferredcites →https://doi.org/10.1287/opre.1070.0450openalex-snapshot
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
inferredcites →https://doi.org/10.1287/opre.31.3.507openalex-snapshot
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/trsc.1060.0147openalex-snapshot
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4666187openalex-extracted
Optimizing Decisions in Vehicle Routing Problems Using Deep Reinforcement Learning: Overview And Systematic Review
inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_16openalex-snapshot
Single Vehicle’s Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time
inferred← citeshttps://doi.org/10.1007/s00291-020-00594-wopenalex-snapshot
Online routing and scheduling of search-and-rescue teams
inferred← citeshttps://doi.org/10.1007/s10696-026-09665-6openalex-snapshot
An effective heuristic algorithm for void fills insertion in e-commerce parcel boxes: a smart packaging system
inferred← citeshttps://doi.org/10.1007/s10878-016-0079-8openalex-snapshot
On the online multi-agent O–D k-Canadian Traveler Problem
inferred← citeshttps://doi.org/10.1007/s10878-017-0227-9openalex-snapshot
Online covering salesman problem
inferred← citeshttps://doi.org/10.1007/s10878-021-00720-6openalex-snapshot
The m-Steiner Traveling Salesman Problem with online edge blockages
inferred← citeshttps://doi.org/10.1007/s10878-022-00876-9openalex-snapshot
Online routing and searching on graphs with blocked edges
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107604openalex-snapshot
Recent dynamic vehicle routing problems: A survey
inferred← citeshttps://doi.org/10.1016/j.cie.2026.112446openalex-snapshot
Dynamic mobile production vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2015.12.013openalex-snapshot
The Steiner traveling salesman problem with online advanced edge blockages
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105533openalex-snapshot
An online optimization approach for post-disaster relief distribution with online blocked edges
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.08.017openalex-snapshot
Online minimum latency problem with edge uncertainty
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.02.038openalex-snapshot
Weighted online minimum latency problem with edge uncertainty
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106177openalex-snapshot
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.trb.2021.05.017openalex-snapshot
An online optimization approach to post-disaster road restoration
inferred← citeshttps://doi.org/10.1080/02522667.2017.1367494openalex-snapshot
A simulated annealing heuristic for the online symmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1080/24725854.2024.2410353openalex-snapshot
On delivery policies for a truck-and-drone tandem in disaster relief
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9993099openalex-snapshot
Online Multi-Robot Task Assignment with Stochastic Blockages
inferred← citeshttps://doi.org/10.1109/icmlc.2016.7872949openalex-snapshot
Enhancement of traveling salesman problem by hybridization of greedy and 2-opt techniques
inferred← citeshttps://doi.org/10.1111/itor.12419openalex-snapshot
A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
inferred← citeshttps://doi.org/10.1137/1.9781611975994.140openalex-snapshot
A PTAS for subset TSP in minor-free graphs
inferred← citeshttps://doi.org/10.70675/da408374z2c23z4ab1zbabdz0a51d084ef7fopenalex-snapshot
Online and Approximation Algorithms : Beyond Worst-Case Paradigms
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.