On the public citation graph

Optimal Path Planning Under Priori Information In Stochastic, Time-Varying Networks

https://doi.org/10.5281/zenodo.1327835
0 signed · 7 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/net.3230230305openalex-extracted
Shortest paths in stochastic networks with ARC lengths having discrete distributions
inferredcites →https://doi.org/10.1016/0022-247x(66)90009-6openalex-extracted
The shortest route through a network with time-dependent internodal transit times
inferredcites →https://doi.org/10.1016/s0191-2615(00)00019-9openalex-extracted
An adaptive routing algorithm for in-vehicle route guidance systems with real-time information
inferredcites →https://doi.org/10.1016/s0305-0548(98)00027-6openalex-extracted
Least possible time paths in stochastic,time-varying networks
inferredcites →https://doi.org/10.1016/s0377-2217(02)00231-xopenalex-extracted
Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
inferredcites →https://doi.org/10.1287/trsc.20.3.182openalex-extracted
The Fastest Path through a Network with Random Time-Dependent Travel Times
inferredcites →https://doi.org/10.3141/1645-21openalex-extracted
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
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.