On the public citation graph
Consistent iterative algorithm for stochastic dynamic traffic assignment with a stable route set
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.
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.1007/978-0-387-75857-2openalex-snapshot
Transportation Systems Analysis: Models and Applications
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_24openalex-snapshot
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
inferredcites →https://doi.org/10.1007/bf01448839openalex-snapshot
�ber die partiellen Differenzengleichungen der mathematischen Physik
inferredcites →https://doi.org/10.1007/bf01553908openalex-snapshot
A bidirectional shortest-path algorithm with good average-case behavior
inferredcites →https://doi.org/10.1007/s10479-006-0009-8openalex-snapshot
Evaluation of choice set generation algorithms for route choice models
inferredcites →https://doi.org/10.1007/s40999-018-0363-3openalex-snapshot
An Alternative Stochastic User Equilibrium Formulation Based on Regret Theory
inferredcites →https://doi.org/10.1016/0041-1647(71)90012-8openalex-snapshot
A probabilistic multipath traffic assignment model which obviates path enumeration
inferredcites →https://doi.org/10.1016/0191-2615(95)00005-xopenalex-snapshot
Alternatives to Dial's logit assignment algorithm
inferredcites →https://doi.org/10.1016/j.trb.2006.06.003openalex-snapshot
Capturing correlation with subnetworks in route choice models
inferredcites →https://doi.org/10.1016/j.trb.2007.08.002openalex-snapshot
Closed form expressions for choice probabilities in the Weibull case
inferredcites →https://doi.org/10.1016/j.trb.2013.07.012openalex-snapshot
A link based network route choice model with unrestricted choice set
inferredcites →https://doi.org/10.1016/j.trb.2015.01.005openalex-snapshot
Beyond normality: A cross moment-stochastic user equilibrium model
inferredcites →https://doi.org/10.1016/j.trb.2015.03.015openalex-snapshot
A nested recursive logit model for route choice analysis
inferredcites →https://doi.org/10.1016/j.trb.2015.12.013openalex-snapshot
An efficient iterative link transmission model
inferredcites →https://doi.org/10.1016/j.trb.2020.02.006openalex-snapshot
Path Size Logit route choice models: Issues with current models, a new internally consistent approach, and parameter estimation on a large-scale network with GPS data
inferredcites →https://doi.org/10.1016/j.trc.2013.12.009openalex-snapshot
Improving the efficiency of repeated dynamic network loading through marginal simulation
inferredcites →https://doi.org/10.1016/s0191-2615(99)00029-6openalex-snapshot
A stochastic transit assignment model considering differences in passengers utility functions
inferredcites →https://doi.org/10.1016/s0377-2217(99)00214-3openalex-snapshot
On finding dissimilar paths
inferredcites →https://doi.org/10.1016/s1474-6670(17)43956-5openalex-snapshot
Stochastic User Equilibrium Assignment with Explicit Path Enumeration: Comparison of Models and Algorithms
inferredcites →https://doi.org/10.1016/s1755-5345(13)70005-8openalex-snapshot
Route choice modeling: past, present and future research directions
inferredcites →https://doi.org/10.1023/a:1012827724856openalex-snapshot
Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future
inferredcites →https://doi.org/10.1080/18128600708685672openalex-snapshot
STOCHASTIC ROUTE CHOICE SET GENERATION: BEHAVIORAL AND PROBABILISTIC FOUNDATIONS
inferredcites →https://doi.org/10.1109/tac.2012.2211175openalex-snapshot
Choice Prediction With Semidefinite Optimization When Utilities are Correlated
inferredcites →https://doi.org/10.1111/j.1467-8667.2011.00717.xopenalex-snapshot
A Cell‐Based Model for Multi‐class Doubly Stochastic Dynamic Traffic Assignment
inferredcites →https://doi.org/10.1111/j.1538-4632.1997.tb00966.xopenalex-snapshot
A Minimax Method for Finding the k Best “Differentiated” Paths
inferredcites →https://doi.org/10.1287/opre.2013.1202openalex-snapshot
An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem
inferredcites →https://doi.org/10.3141/1733-11openalex-snapshot
Congestion, Stochastic, and Similarity Effects in Stochastic: User-Equilibrium Models
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.4673353openalex-extracted
Encoding Path Sets in Acyclic Subgraphs
inferred← citeshttps://doi.org/10.1016/j.trb.2022.11.012openalex-snapshot
General solution scheme for the static link transmission model
inferred← citeshttps://doi.org/10.1111/mice.12968openalex-snapshot
Characterizing zebra crossing zones using LiDAR data
inferred← citeshttps://doi.org/10.1111/mice.12994openalex-snapshot
A coordinated ramp metering framework based on heterogeneous causal inference
inferred← citeshttps://doi.org/10.1111/mice.13066openalex-snapshot
Construction and demolition waste disposal charging scheme design
inferred← citeshttps://doi.org/10.21105/joss.04593openalex-snapshot
dyntapy: dynamic and static traffic assignment in Python
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.