On the public citation graph

Online traveling salesman problems with rejection options

0 signed · 44 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1002/net.20454openalex-snapshot
Online traveling salesman problems with service flexibility
inferredcites →https://doi.org/10.1002/net.3230190602openalex-snapshot
The prize collecting traveling salesman problem
inferredcites →https://doi.org/10.1007/11533719_74openalex-snapshot
On the Power of Lookahead in On-Line Vehicle Routing Problems
inferredcites →https://doi.org/10.1007/3-540-29297-7openalex-snapshot
Combinatorial Optimization: Theory and Algorithms
inferredcites →https://doi.org/10.1007/3-540-46541-3_53openalex-snapshot
Online Dial-a-Ride Problems: Minimizing the Completion Time
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_58openalex-snapshot
The Power of Recourse for Online MST and TSP
inferredcites →https://doi.org/10.1007/978-3-662-21708-5openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1007/s10878-012-9571-yopenalex-snapshot
Online graph exploration algorithms for cycles and trees by multiple searchers
inferredcites →https://doi.org/10.1016/0304-3975(94)90155-4openalex-snapshot
Constructing competitive tours from local information
inferredcites →https://doi.org/10.1016/j.ipl.2004.06.013openalex-snapshot
Algorithms for the On-Line Quota Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/j.ipl.2008.03.002openalex-snapshot
The online Prize-Collecting Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/j.tcs.2008.08.003openalex-snapshot
On the power of lookahead in on-line server routing problems
inferredcites →https://doi.org/10.1016/j.tcs.2012.06.034openalex-snapshot
Online graph exploration: New results on old and new algorithms
inferredcites →https://doi.org/10.1016/s0304-3975(02)00409-7openalex-snapshot
News from the online traveling repairman
inferredcites →https://doi.org/10.1016/s0898-1221(01)90023-9openalex-snapshot
Combinatorial optimization: Theory and algorithms
inferredcites →https://doi.org/10.1057/jors.1986.93openalex-snapshot
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
inferredcites →https://doi.org/10.1287/ijoc.13.2.138.10517openalex-snapshot
The Online TSP Against Fair Adversaries
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/trsc.1030.0079openalex-snapshot
Traveling Salesman Problems with Profits
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.1002/nav.21804openalex-snapshot
Aggregating courier deliveries
inferred← citeshttps://doi.org/10.1002/net.21628openalex-snapshot
Dynamic vehicle routing problems: Three decades and counting
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/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-64605-8_24openalex-snapshot
Reinforcement Learning Applied to the Dynamic Capacitated Profitable Tour Problem with Stochastic Requests
inferred← citeshttps://doi.org/10.1007/978-3-319-51741-4_2openalex-snapshot
Dynamic Traveling Repair Problem with an Arbitrary Time Window
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_19openalex-snapshot
Relaxing the Irrevocability Requirement for Online Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-16-6372-7_39openalex-snapshot
The Stochastic and Dynamic Vehicle Routing Problem: A Literature Review
inferred← citeshttps://doi.org/10.1007/s00453-022-00944-wopenalex-snapshot
Relaxing the Irrevocability Requirement for Online Graph Algorithms
inferred← citeshttps://doi.org/10.1007/s10878-017-0215-0openalex-snapshot
Online in-time service problem with minimal server assignment
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106314openalex-snapshot
Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
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.trb.2024.102984openalex-snapshot
The Capacitated Team Orienteering Problem: An online optimization framework with predictions of unknown accuracy
inferred← citeshttps://doi.org/10.1109/gol.2016.7731713openalex-snapshot
The multi-period and multi-depot dynamic vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1109/icpads.2017.00028openalex-snapshot
Online Auctions with Dynamic Costs for Ridesharing
inferred← citeshttps://doi.org/10.1111/mice.12308openalex-snapshot
On‐Line Vehicle Routing Problems for Carbon Emissions Reduction
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.1287/moor.2014.0684openalex-snapshot
From Cost Sharing Mechanisms to Online Selection Problems
inferred← citeshttps://doi.org/10.1287/opre.2015.1472openalex-snapshot
Supply Chain Management with Online Customer Selection
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.4230/lipics.icalp.2021.28openalex-snapshot
Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times
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.