On the public citation graph

Navigating Uncertainty: A Consensus-Based Algorithm for Solving the Stochastic Canadian Traveler Problem

0 signed · 36 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.1007/978-3-030-39479-0_3openalex-extracted
Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts
inferredcites →https://doi.org/10.1007/978-3-540-85097-7_39openalex-extracted
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
inferredcites →https://doi.org/10.1007/978-3-642-35261-4_38openalex-extracted
The Canadian Traveller Problem Revisited
inferredcites →https://doi.org/10.1007/s00453-020-00792-6openalex-extracted
Approximating the Canadian Traveller Problem with Online Randomization
inferredcites →https://doi.org/10.1007/s10489-018-1248-5openalex-extracted
Posterior sampling for Monte Carlo planning under uncertainty
inferredcites →https://doi.org/10.1007/s10878-008-9156-yopenalex-extracted
The canadian traveller problem and its competitive analysis
inferredcites →https://doi.org/10.1007/s10878-012-9503-xopenalex-extracted
The k-Canadian Travelers Problem with communication
inferredcites →https://doi.org/10.1007/s10878-013-9634-8openalex-extracted
An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths
inferredcites →https://doi.org/10.1007/s10878-014-9766-5openalex-extracted
Optimal shortest path set problem in undirected graphs
inferredcites →https://doi.org/10.1007/s10878-016-0079-8openalex-extracted
On the online multi-agent O–D k-Canadian Traveler Problem
inferredcites →https://doi.org/10.1007/s10878-018-0324-4openalex-extracted
Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem
inferredcites →https://doi.org/10.1007/s10878-019-00378-1openalex-extracted
On the randomized online strategies for the k-Canadian traveler problem
inferredcites →https://doi.org/10.1007/s10878-019-00438-6openalex-extracted
Multiple Canadians on the road: minimizing the distance competitive ratio
inferredcites →https://doi.org/10.1007/s11069-017-3069-yopenalex-extracted
A GIS framework for evaluating the implications of urban road network failure due to earthquakes: Bucharest (Romania) case study
inferredcites →https://doi.org/10.1016/0304-3975(91)90263-2openalex-extracted
Shortest paths without a map
inferredcites →https://doi.org/10.1016/j.cie.2021.107488openalex-extracted
Heuristics for the Canadian traveler problem with neutralizations
inferredcites →https://doi.org/10.1016/j.cor.2016.05.002openalex-extracted
New reformulations of distributionally robust shortest path problem
inferredcites →https://doi.org/10.1016/j.cor.2021.105533openalex-extracted
An online optimization approach for post-disaster relief distribution with online blocked edges
inferredcites →https://doi.org/10.1016/j.eswa.2019.05.001openalex-extracted
Canadian Traveler Problem with Neutralizations
inferredcites →https://doi.org/10.1016/j.ijdrr.2018.05.017openalex-extracted
Earthquake building debris estimation in historic city centres: From real world data to experimental-based criteria
inferredcites →https://doi.org/10.1016/j.ipl.2007.10.004openalex-extracted
A note on the k-Canadian Traveller Problem
inferredcites →https://doi.org/10.1016/j.procs.2018.10.295openalex-extracted
Solving Stochastic Shortest Distance Path Problem by Using Genetic Algorithms
inferredcites →https://doi.org/10.1016/j.tcs.2013.03.016openalex-extracted
Complexity of Canadian traveler problem variants
inferredcites →https://doi.org/10.1109/icra.2019.8794252openalex-extracted
The Robust Canadian Traveler Problem Applied to Robot Routing
inferredcites →https://doi.org/10.1111/mice.12103openalex-extracted
Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution
inferredcites →https://doi.org/10.1145/375735.375806openalex-extracted
A system for multi-agent coordination in uncertain environments
inferredcites →https://doi.org/10.1147/jrd.2019.2947002openalex-extracted
Online optimization of first-responder routes in disaster response logistics
inferredcites →https://doi.org/10.1177/8755293019892423openalex-extracted
Statistical analysis of earthquake debris extent from wood‐frame buildings and its use in road networks in Japan
inferredcites →https://doi.org/10.1287/ijoc.2015.0668openalex-extracted
An AO* Based Exact Algorithm for the Canadian Traveler Problem
inferredcites →https://doi.org/10.1287/opre.1040.0124openalex-extracted
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
inferredcites →https://doi.org/10.1609/aaai.v24i1.7542openalex-extracted
High-Quality Policies for the Canadian Traveler's Problem
inferredcites →https://doi.org/10.1609/socs.v1i1.18154openalex-extracted
High-Quality Policies for the Canadian Traveler's Problem
inferredcites →https://doi.org/10.3233/aic-150665openalex-extracted
Repeated-task Canadian Traveler Problem
inferredcites →https://doi.org/10.48550/arxiv.2108.13265openalex-extracted
Predicting Road Flooding Risk with Machine Learning Approaches Using Crowdsourced Reports and Fine-grained Traffic Data
inferredcites →https://doi.org/10.5555/127787.127835openalex-extracted
The Canadian Traveller Problem
inferredcites →https://doi.org/10.1007/978-3-662-46081-8_1openalex-snapshot
Variations on the Stochastic Shortest Path Problem
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.