On the public citation graph
Modeling Flexible Robust Shortest Path Problem in Citywide Road Networks with Time-dependent Uncertainty
0 signed · 42 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.
1 of the 42 references listed on this page is in the Retraction Watch database as retracted (export 2026-11-18): 10.3233/jifs-219188 (notice 2026-07-15).
Dataset join, best-effort; this page does not check the publisher record. Retraction Watch data via Crossref Labs, used with credit; OpenCitations Index (CC0) and Meta (CC BY 4.0); dataset doi:10.7910/DVN/WT8VOA (CC BY 4.0).
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/net.21909openalex-snapshot
An exact method for a class of robust shortest path problems with scenarios
inferredcites →https://doi.org/10.1007/s10107-003-0396-4openalex-snapshot
Robust discrete optimization and network flows
inferredcites →https://doi.org/10.1007/s10479-011-1004-2openalex-snapshot
New models for the robust shortest path problem: complexity, resolution and generalization
inferredcites →https://doi.org/10.1007/s11067-017-9345-2openalex-snapshot
Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation
inferredcites →https://doi.org/10.1007/s11590-021-01712-5openalex-snapshot
Shortest path network problems with stochastic arc weights
inferredcites →https://doi.org/10.1016/j.cor.2019.01.007openalex-snapshot
Determining time-dependent minimum cost paths under several objectives
inferredcites →https://doi.org/10.1016/j.cor.2019.03.010openalex-snapshot
The Resource Constrained Shortest Path Problem with uncertain data: A robust formulation and optimal solution approach
inferredcites →https://doi.org/10.1016/j.cor.2021.105212openalex-snapshot
An approach to the distributionally robust shortest path problem
inferredcites →https://doi.org/10.1016/j.ejor.2008.12.036openalex-snapshot
Robustness in operational research and decision aiding: A multi-faceted issue
inferredcites →https://doi.org/10.1016/j.ejor.2018.10.006openalex-snapshot
Algorithms and uncertainty sets for data-driven robust shortest path problems
inferredcites →https://doi.org/10.1016/j.ejor.2020.01.009openalex-snapshot
Wasserstein distributionally robust shortest path problem
inferredcites →https://doi.org/10.1016/j.eswa.2020.113192openalex-snapshot
Reliable shortest path finding in stochastic time-dependent road network with spatial-temporal link correlations: A case study from Beijing
inferredcites →https://doi.org/10.1016/j.sbspro.2013.08.053openalex-snapshot
Finding Reliable Shortest Path in Stochastic Time-dependent Network
inferredcites →https://doi.org/10.1016/j.tranpol.2021.01.002openalex-snapshot
Taxi vs. demand responsive shared transport systems: An agent-based simulation approach
inferredcites →https://doi.org/10.1016/j.trb.2009.11.003openalex-snapshot
The α-reliable mean-excess traffic equilibrium model with stochastic travel times
inferredcites →https://doi.org/10.1016/j.trb.2021.06.005openalex-snapshot
Mobility service design via joint optimization of transit networks and demand-responsive services
inferredcites →https://doi.org/10.1016/j.trb.2021.06.016openalex-snapshot
Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm
inferredcites →https://doi.org/10.1016/j.trc.2021.103436openalex-snapshot
Reliable trajectory-adaptive routing strategies in stochastic, time-varying networks with generalized correlations
inferredcites →https://doi.org/10.1016/j.trc.2022.103866openalex-snapshot
Travel time reliability in transportation networks: A review of methodological developments
inferredcites →https://doi.org/10.1016/j.tre.2013.07.002openalex-snapshot
An outer approximation algorithm for the robust shortest path problem
inferredcites →https://doi.org/10.1016/s0305-0548(97)00085-3openalex-snapshot
On the Robust Shortest Path Problem
inferredcites →https://doi.org/10.1016/s0305-0548(98)00027-6openalex-snapshot
Least possible time paths in stochastic,time-varying networks
inferredcites →https://doi.org/10.1016/s0377-2217(02)00147-9openalex-snapshot
Vehicle dispatching with time-dependent travel times
inferredcites →https://doi.org/10.1016/s0377-2217(99)00388-4openalex-snapshot
An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
inferredcites →https://doi.org/10.1080/21642583.2018.1531082openalex-snapshot
The robust shortest path problem for multimodal transportation considering timetable with interval data
inferredcites →https://doi.org/10.1109/tits.2013.2250966openalex-snapshot
Reformulation and Solution Algorithms for Absolute and Percentile Robust Shortest Path Problems
inferredcites →https://doi.org/10.1109/tits.2013.2270282openalex-snapshot
Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks With Stochastic First-In-First-Out Property
inferredcites →https://doi.org/10.1109/tits.2017.2709798openalex-snapshot
Robust Shortest Path Problem With Distributional Uncertainty
inferredcites →https://doi.org/10.1109/tits.2020.2983491openalex-snapshot
Reliable Path Planning for Drone Delivery Using a Stochastic Time-Dependent Public Transportation Network
inferredcites →https://doi.org/10.1109/tits.2022.3153397openalex-snapshot
Quantify the Road Link Performance and Capacity Using Deep Learning Models
inferredcites →https://doi.org/10.1109/tits.2023.3276190openalex-snapshot
Spatio-Temporal Characterization of Stochastic Dynamic Transportation Networks
inferredcites →https://doi.org/10.1111/mice.12103openalex-snapshot
Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution
inferredcites →https://doi.org/10.1145/3459099openalex-snapshot
PARP: A Parallel Traffic Condition Driven Route Planning Model on Dynamic Road Networks
inferredcites →https://doi.org/10.1287/opre.2014.1314openalex-snapshot
Distributionally Robust Convex Optimization
inferredcites →https://doi.org/10.1287/opre.2020.2089openalex-snapshot
The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks
inferredcites →https://doi.org/10.1287/trsc.20.3.182openalex-snapshot
The Fastest Path through a Network with Random Time-Dependent Travel Times
inferredcites →https://doi.org/10.1287/trsc.2015.0668openalex-snapshot
Pruning Algorithms to Determine Reliable Paths on Networks with Random and Correlated Link Travel Times
inferredcites →https://doi.org/10.1287/trsc.2023.0013openalex-snapshot
Reliable Routing Strategies on Urban Transportation Networks
inferredcites →https://doi.org/10.3141/2467-12openalex-snapshot
Sample-Based Algorithm to Determine Minimum Robust Cost Path with Correlated Link Travel Times
inferredcites →https://doi.org/10.3233/jifs-219188openalex-snapshot
Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment
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.