On the public citation graph
Algorithms for the On-Line Travelling Salesman1
0 signed · 167 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/j.1538-7305.1966.tb01709.xopenalex-snapshot
Bounds for Certain Multiprocessing Anomalies
inferredcites →https://doi.org/10.1007/3-540-56939-1_65openalex-snapshot
Constructing competitive tours from local information
inferredcites →https://doi.org/10.1007/3-540-57568-5_280openalex-snapshot
Vehicle scheduling on a tree with release and handling times
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferredcites →https://doi.org/10.1090/dimacs/007/13openalex-snapshot
Scheduling parallel machines on-line
inferredcites →https://doi.org/10.1109/sfcs.1991.185361openalex-snapshot
Scheduling parallel machines on-line
inferredcites →https://doi.org/10.1109/sfcs.1992.267758openalex-snapshot
Competitive analysis of financial games
inferredcites →https://doi.org/10.1137/0207017openalex-snapshot
Approximation Algorithms for Some Routing Problems
inferredcites →https://doi.org/10.1137/0217053openalex-snapshot
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
inferredcites →https://doi.org/10.1137/0221066openalex-snapshot
Preemptive Ensemble Motion Planning on a Tree
inferredcites →https://doi.org/10.1137/0222005openalex-snapshot
A Note on the Complexity of a Simple Transportation Problem
inferredcites →https://doi.org/10.1145/100216.100268openalex-snapshot
On the power of randomization in online algorithms
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1287/mnsc.36.2.212openalex-snapshot
Routing and Scheduling on a Shoreline with Release Times
inferredcites →https://doi.org/10.1287/opre.35.2.254openalex-snapshot
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
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.4145446openalex-extracted
Competitive Perimeter Defense in Linear Environments
inferred← citeshttps://doi.org/10.1002/net.10091openalex-snapshot
Reoptimizing the traveling salesman problem
inferred← citeshttps://doi.org/10.1002/net.20180openalex-snapshot
Competitive analysis for dynamic multiperiod uncapacitated routing problems
inferred← citeshttps://doi.org/10.1002/net.20454openalex-snapshot
Online traveling salesman problems with service flexibility
inferred← citeshttps://doi.org/10.1002/net.21559openalex-snapshot
Online traveling salesman problems with rejection options
inferred← citeshttps://doi.org/10.1002/net.22281openalex-snapshot
Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?
inferred← citeshttps://doi.org/10.1007/11496199_11openalex-snapshot
On the Online Dial-A-Ride Problem with Time-Windows
inferred← citeshttps://doi.org/10.1007/11533719_74openalex-snapshot
On the Power of Lookahead in On-Line Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/11534273_27openalex-snapshot
The On-line Asymmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/11671411_18openalex-snapshot
The Online Target Date Assignment Problem
inferred← citeshttps://doi.org/10.1007/11671411_20openalex-snapshot
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem
inferred← citeshttps://doi.org/10.1007/11750321_1openalex-snapshot
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance
inferred← citeshttps://doi.org/10.1007/11775096_4openalex-snapshot
Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_10openalex-snapshot
Algorithms and Models for the On-Line Vertex-Covering
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_43openalex-snapshot
News from the Online Traveling Repairman
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_4openalex-snapshot
Linear Time Approximation Schemes for Vehicle Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_59openalex-snapshot
On-Line Dial-a-Ride Problems under a Restricted Information Model
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_18openalex-snapshot
Non-Abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_11openalex-snapshot
The Online Dial-a-Ride Problem under Reasonable Load
inferred← citeshttps://doi.org/10.1007/978-0-387-71722-7_2openalex-snapshot
Classification Of Dynamic Vehicle Routing Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_10openalex-snapshot
Online Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_9openalex-snapshot
Recent Developments in Dynamic Vehicle Routing Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_20openalex-snapshot
Online Travelling Salesman Problem on a Circle
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_14openalex-snapshot
New Bounds for Maximizing Revenue in Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1007/978-3-031-18367-6_8openalex-snapshot
An Improved Algorithm for Open Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_4openalex-snapshot
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_5openalex-snapshot
Online TSP with Known Locations
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_38openalex-snapshot
Maximizing Revenues for On-Line Dial-a-Ride
inferred← citeshttps://doi.org/10.1007/978-3-319-22363-6_8openalex-snapshot
Oriented Online Route Recommendation for Spatial Crowdsourcing Task Workers
inferred← citeshttps://doi.org/10.1007/978-3-319-39817-4_14openalex-snapshot
Online Scheduling with Increasing Subsequence Serving Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_62openalex-snapshot
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_32openalex-snapshot
Algorithms for the On-Line Quota Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-47450-0_10openalex-snapshot
Autonomous Decision Model Adaptation and the Vehicle Routing Problem with Time Windows and Uncertain Demand
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_13openalex-snapshot
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
inferred← citeshttps://doi.org/10.1007/978-3-540-74581-5_7openalex-snapshot
An Evolutionary Algorithm for Dynamic Multi-Objective TSP
inferred← citeshttps://doi.org/10.1007/978-3-540-85984-0_21openalex-snapshot
A Parallel Multi-algorithm Solver for Dynamic Multi-Objective TSP (DMO-TSP)
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_38openalex-snapshot
Online Graph Exploration: New Results on Old and New Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-27612-5_4openalex-snapshot
Adaptation of Optimization Models in Volatile Transport Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-662-04331-8_33openalex-snapshot
Combinatorial Online Optimization in Real Time
inferred← citeshttps://doi.org/10.1007/978-3-662-04331-8_34openalex-snapshot
Online Optimization of Complex Transportation Systems
inferred← citeshttps://doi.org/10.1007/978-981-96-4445-2_14openalex-snapshot
Competitive Algorithms for Online Traveling Salesman Problem on a Semi-line
inferred← citeshttps://doi.org/10.1007/bf02936352openalex-snapshot
On-line independent set by coloring vertices
inferred← citeshttps://doi.org/10.1007/s00224-008-9103-4openalex-snapshot
Online k-Server Routing Problems
inferred← citeshttps://doi.org/10.1007/s00291-024-00744-4openalex-snapshot
Online algorithms for ambulance routing in disaster response with time-varying victim conditions
inferred← citeshttps://doi.org/10.1007/s00453-004-1116-zopenalex-snapshot
On-Line Dial-a-Ride Problems Under a Restricted Information Model
inferred← citeshttps://doi.org/10.1007/s00453-022-01061-4openalex-snapshot
Improved Bounds for Open Online Dial-a-Ride on the Line
inferred← citeshttps://doi.org/10.1007/s10115-016-0938-8openalex-snapshot
Emergency management using geographic information systems: application to the first Romanian traveling salesman problem instance
inferred← citeshttps://doi.org/10.1007/s10732-017-9359-4openalex-snapshot
Dynamic region visit routing problem for vehicles with minimum turning radius
inferred← citeshttps://doi.org/10.1007/s10878-012-9571-yopenalex-snapshot
Online graph exploration algorithms for cycles and trees by multiple searchers
inferred← citeshttps://doi.org/10.1007/s10878-013-9654-4openalex-snapshot
Online traveling salesman problem with deadlines and service flexibility
inferred← citeshttps://doi.org/10.1007/s10878-017-0188-zopenalex-snapshot
From theory to practice: maximizing revenues for on-line dial-a-ride
inferred← citeshttps://doi.org/10.1007/s10878-025-01387-zopenalex-snapshot
PTAS for Euclidean travelling salesman problem with soft time windows
inferred← citeshttps://doi.org/10.1007/s10878-026-01457-wopenalex-snapshot
Algorithms with competitive analysis for online traveling salesman problem on a semi-line
inferred← citeshttps://doi.org/10.1007/s10951-005-6811-3openalex-snapshot
A Hard Dial-a-Ride Problem that is Easy on Average
inferred← citeshttps://doi.org/10.1007/s11276-012-0447-yopenalex-snapshot
Distributed event-triggered path construction in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11750-019-00506-4openalex-snapshot
Fleet management for autonomous vehicles using flows in time-expanded networks
inferred← citeshttps://doi.org/10.1007/s43069-021-00076-xopenalex-snapshot
Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1016/j.cor.2008.04.009openalex-snapshot
Online decision making and automatic decision model adaptation
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.ejor.2014.03.014openalex-snapshot
Online stochastic UAV mission planning with time windows and time-sensitive targets
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.04.037openalex-snapshot
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.11.013openalex-snapshot
The Steiner Traveling Salesman Problem with online edge blockages
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.eswa.2022.116602openalex-snapshot
A multi-agent system for solving the Dynamic Capacitated Vehicle Routing Problem with stochastic customers using trajectory data mining
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.013openalex-snapshot
Algorithms for the On-Line Quota Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.03.002openalex-snapshot
The online Prize-Collecting Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.03.025openalex-snapshot
Online chasing problems for regular polygons
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.024openalex-snapshot
New lower bounds for online k-server routing problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.10.013openalex-snapshot
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.007openalex-snapshot
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
inferred← citeshttps://doi.org/10.1016/j.jda.2005.12.005openalex-snapshot
On Multi-threaded Metrical Task Systems
inferred← citeshttps://doi.org/10.1016/j.jda.2007.03.002openalex-snapshot
The on-line asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.omega.2019.06.006openalex-snapshot
A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice
inferred← citeshttps://doi.org/10.1016/j.orl.2007.02.006openalex-snapshot
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
inferred← citeshttps://doi.org/10.1016/j.seps.2014.02.003openalex-snapshot
Bi-objective decision support system for routing and scheduling of hazardous materials
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.003openalex-snapshot
On the power of lookahead in on-line server routing problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.034openalex-snapshot
Online graph exploration: New results on old and new algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.026openalex-snapshot
The Covering Canadian Traveller Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.045openalex-snapshot
Pricing and allocation algorithm designs in dynamic ridesharing system
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.003openalex-snapshot
Orienteering problem with time-windows and updating delay
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.007openalex-snapshot
The online food delivery problem on stars
inferred← citeshttps://doi.org/10.1016/j.trb.2024.102984openalex-snapshot
The Capacitated Team Orienteering Problem: An online optimization framework with predictions of unknown accuracy
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00261-9openalex-snapshot
On-line single-server dial-a-ride problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00323-1openalex-snapshot
Two short notes on the on-line travelling salesman: handling times and lookahead
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00409-7openalex-snapshot
News from the online traveling repairman
inferred← citeshttps://doi.org/10.1017/s0263574718000735openalex-snapshot
A survey on routing problems and robotic systems
inferred← citeshttps://doi.org/10.1023/b:josh.0000019683.85186.57openalex-snapshot
On-Line Algorithms for the Dynamic Traveling Repair Problem
inferred← citeshttps://doi.org/10.1051/ro/2011114openalex-snapshot
A survey on combinatorial optimization in dynamic environments
inferred← citeshttps://doi.org/10.1051/ro:2006014openalex-snapshot
On-line models and algorithms for max independent set
inferred← citeshttps://doi.org/10.1063/1.4757168openalex-snapshot
Risk‐based Inspection Scheduling Planning for Intelligent Agent in the Autonomous Fault Management
inferred← citeshttps://doi.org/10.1080/10556780701550026openalex-snapshot
New policies for the dynamic 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/cai68641.2026.11536635openalex-snapshot
Online Routing Problems under Spatial Locality
inferred← citeshttps://doi.org/10.1109/cec.2004.1331045openalex-snapshot
Benchmarking algorithms for dynamic travelling salesman problems
inferred← citeshttps://doi.org/10.1109/cec.2008.4630839openalex-snapshot
Multi-algorithm co-evolution strategy for Dynamic Multi-Objective TSP
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00035openalex-snapshot
Online Route Planning over Time-Dependent Road Networks
inferred← citeshttps://doi.org/10.1109/icmss.2009.5303885openalex-snapshot
Online Dial-A-Ride Problem with Unequal-Length Time-Windows
inferred← citeshttps://doi.org/10.1109/icpads.2017.00028openalex-snapshot
Online Auctions with Dynamic Costs for Ridesharing
inferred← citeshttps://doi.org/10.1109/tla.2017.7854617openalex-snapshot
Multi-goal Path Planning Autonomous System for Picking up and Delivery Tasks in Mobile Robotics
inferred← citeshttps://doi.org/10.1109/tsc.2019.2905564openalex-snapshot
Client-Side Service for Recommending Rewarding Routes to Mobile Crowdsourcing Workers
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2005.00497.xopenalex-snapshot
On-line maximum-order induced hereditary subgraph problems
inferred← citeshttps://doi.org/10.1137/1.9781611974782.63openalex-snapshot
Tight Bounds for Online TSP on the Line
inferred← citeshttps://doi.org/10.1137/130917703openalex-snapshot
The Power of Recourse for Online MST and TSP
inferred← citeshttps://doi.org/10.1137/19m1268513openalex-snapshot
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
inferred← citeshttps://doi.org/10.1137/24m1657833openalex-snapshot
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1142/s0129054123470020openalex-snapshot
Online Predictions for Online TSP on the Line
inferred← citeshttps://doi.org/10.1145/3173127.3173145openalex-snapshot
SIGACT News Online Algorithms Column 32
inferred← citeshttps://doi.org/10.1145/3422362openalex-snapshot
Tight Bounds for Online TSP on the Line
inferred← citeshttps://doi.org/10.1155/2022/1450756openalex-snapshot
A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model
inferred← citeshttps://doi.org/10.1177/10591478251313785openalex-snapshot
Design and Analysis of Efficient Sequencing Policies for Linear Cold Storage Devices
inferred← citeshttps://doi.org/10.1177/10591478261438365openalex-snapshot
The online election campaign planning problem: Optimizing election campaign strategies with inaccurate information
inferred← citeshttps://doi.org/10.1287/ijoc.2023.0478openalex-snapshot
Online TSP and Online Dial-a-Ride with Predictions
inferred← citeshttps://doi.org/10.1287/mksc.1080.0400openalex-snapshot
Path Data in Marketing: An Integrative Framework and Prospectus for Model Building
inferred← citeshttps://doi.org/10.1287/mksc.1080.0402openalex-snapshot
Research Note—The Traveling Salesman Goes Shopping: The Systematic Deviations of Grocery Paths from TSP Optimality
inferred← citeshttps://doi.org/10.1287/opre.1070.0450openalex-snapshot
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
inferred← citeshttps://doi.org/10.1287/trsc.1060.0147openalex-snapshot
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
inferred← citeshttps://doi.org/10.14279/depositonce-3125openalex-snapshot
The Power of Recourse in Online Optimization: Robust Solutions for Scheduling, Matroid and MST Problems
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.1620openalex-snapshot
The Online Graph Exploration Problem on Restricted Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26414openalex-snapshot
Learning-Augmented Algorithms for Online TSP on the Line
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13743openalex-snapshot
Online Algorithms for the Linear Tape Scheduling Problem
inferred← citeshttps://doi.org/10.17762/turcomat.v12i5.1053openalex-snapshot
Oadrp Having Issues with Due Date and Limitations with Information
inferred← citeshttps://doi.org/10.20965/jaciii.2011.p1199openalex-snapshot
WIN Algorithm for Discrete Online TSP
inferred← citeshttps://doi.org/10.2139/ssrn.4903580openalex-snapshot
Online Traveling Salesmen Should Travel Randomly: A Randomized Zealous Algorithm for the Online Tsp on the Line
inferred← citeshttps://doi.org/10.2991/978-94-6239-148-2_70openalex-snapshot
Based on Fairness Criterion for Multi-objective Emergency Logistics Distribution Path Selection
inferred← citeshttps://doi.org/10.31390/gradschool_theses.1522openalex-snapshot
Offline and online variants of the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.3390/su15021584openalex-snapshot
Online Delivery Problem for Hybrid Truck–Drone System with Independent and Truck-Carried Drones
inferred← citeshttps://doi.org/10.4230/dagsemproc.09261.19openalex-snapshot
Online Traveling Salesman Problems with Flexibility
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.28openalex-snapshot
Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times
inferred← citeshttps://doi.org/10.48550/arxiv.1310.7232openalex-snapshot
Maximizing Revenues for Online-Dial-a-Ride
inferred← citeshttps://doi.org/10.48550/arxiv.1412.2123openalex-snapshot
Distributed Multi-Depot Routing without Communications
inferred← citeshttps://doi.org/10.48550/arxiv.1810.09005openalex-snapshot
Theoretical and Practical Aspects of the Linear Tape Scheduling Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1912.06300openalex-snapshot
The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride
inferred← citeshttps://doi.org/10.5555/545381.545451openalex-snapshot
On-line algorithms for the dynamic traveling repair problem
inferred← citeshttps://doi.org/10.6100/ir616430openalex-snapshot
Models and algorithms for online server routing
inferred← citeshttps://doi.org/10.6100/ir633780openalex-snapshot
Online gathering algorithms for wireless networks
inferred← citeshttps://doi.org/10.70675/8fa1b961za441z4dc6zba7fzb593312660acopenalex-snapshot
Models and algorithms for fleet management of autonomous vehicles
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.