On the public citation graph

Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution

0 signed · 95 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/(sici)1520-6750(199812)45:8<769::aid-nav2>3.0.co;2-#openalex-snapshot
Iterative methods for dynamic stochastic shortest path problems
inferredcites →https://doi.org/10.1002/1097-0037(200101)37:1<35::aid-net4>3.0.co;2-gopenalex-snapshot
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
inferredcites →https://doi.org/10.1002/nav.21540openalex-snapshot
Robust shortest path problems with two uncertain multiplicative cost coefficients
inferredcites →https://doi.org/10.1002/net.10049openalex-snapshot
On the online shortest path problem with limited arc cost dependencies
inferredcites →https://doi.org/10.1002/net.10063openalex-snapshot
A polynomial‐time algorithm to find shortest paths with recourse
inferredcites →https://doi.org/10.1002/net.20374openalex-snapshot
A mean‐variance model for the minimum cost flow problem with stochastic arc costs
inferredcites →https://doi.org/10.1007/978-1-4757-2620-6openalex-snapshot
Robust Discrete Optimization and Its Applications
inferredcites →https://doi.org/10.1007/bf01581153openalex-snapshot
Solving mixed integer nonlinear programs by outer approximation
inferredcites →https://doi.org/10.1007/bf02592064openalex-snapshot
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
inferredcites →https://doi.org/10.1007/pl00011380openalex-snapshot
Robust solutions of Linear Programming problems contaminated with uncertain data
inferredcites →https://doi.org/10.1007/s10107-003-0396-4openalex-snapshot
Robust discrete optimization and network flows
inferredcites →https://doi.org/10.1007/s10479-012-1285-0openalex-snapshot
Value-at-Risk model for hazardous material transportation
inferredcites →https://doi.org/10.1007/s10957-005-7498-5openalex-snapshot
Arriving on Time
inferredcites →https://doi.org/10.1007/s11067-006-9287-6openalex-snapshot
Optimal Routing for Maximizing the Travel Time Reliability
inferredcites →https://doi.org/10.1007/s11067-009-9114-yopenalex-snapshot
User Equilibrium with Recourse
inferredcites →https://doi.org/10.1007/s11067-011-9167-6openalex-snapshot
Optimal Path Problems with Second-Order Stochastic Dominance Constraints
inferredcites →https://doi.org/10.1016/0305-0548(76)90017-4openalex-snapshot
Shortest distance and reliability of probabilistic networks
inferredcites →https://doi.org/10.1016/j.camwa.2004.07.028openalex-snapshot
Shortest paths in stochastic networks with correlated link costs
inferredcites →https://doi.org/10.1016/j.cma.2007.03.003openalex-snapshot
Robust optimization – A comprehensive survey
inferredcites →https://doi.org/10.1016/j.cor.2007.10.016openalex-snapshot
Extended dominance and a stochastic shortest path problem
inferredcites →https://doi.org/10.1016/j.cor.2010.08.003openalex-snapshot
Multi-objective and multi-constrained non-additive shortest path problems
inferredcites →https://doi.org/10.1016/j.cor.2013.09.015openalex-snapshot
Generalized route planning model for hazardous material transportation with VaR and equity considerations
inferredcites →https://doi.org/10.1016/j.disopt.2006.10.011openalex-snapshot
An algorithmic framework for convex mixed integer nonlinear programs
inferredcites →https://doi.org/10.1016/j.ejor.2010.06.035openalex-snapshot
An aggregate label setting policy for the multi-objective shortest path problem
inferredcites →https://doi.org/10.1016/j.ejor.2012.08.004openalex-snapshot
Robust strategies for facility location under uncertainty
inferredcites →https://doi.org/10.1016/j.trb.2005.02.001openalex-snapshot
Optimal routing policy problems in stochastic time-dependent networks
inferredcites →https://doi.org/10.1016/j.trb.2011.06.004openalex-snapshot
Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach
inferredcites →https://doi.org/10.1016/j.trb.2012.08.004openalex-snapshot
On the estimation of arterial route travel time distribution with Markov chains
inferredcites →https://doi.org/10.1016/j.trb.2013.10.012openalex-snapshot
Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem
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/s0167-6377(99)00016-4openalex-snapshot
Robust solutions of uncertain linear programs
inferredcites →https://doi.org/10.1016/s0191-2615(98)00016-2openalex-snapshot
Expected shortest paths in dynamic and stochastic traffic networks
inferredcites →https://doi.org/10.1016/s0305-0548(03)00114-xopenalex-snapshot
An exact algorithm for the robust shortest path problem with interval data
inferredcites →https://doi.org/10.1016/s0305-0548(97)00085-3openalex-snapshot
On the Robust Shortest Path Problem
inferredcites →https://doi.org/10.1061/(asce)0733-947x(2003)129:3(230)openalex-snapshot
Freeway Work Zone Traffic Delay and Cost Optimization Model
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.1111/j.1467-8667.2009.00637.xopenalex-snapshot
Influence of Demand Uncertainty and Correlations on Traffic Predictions and Decisions
inferredcites →https://doi.org/10.1111/j.1467-8667.2011.00720.xopenalex-snapshot
Optimal Routing with Multiple Objectives: Efficient Algorithm and Application to the Hazardous Materials Transportation Problem
inferredcites →https://doi.org/10.1111/j.1467-8667.2011.00724.xopenalex-snapshot
A Dynamic Route Choice Model Considering Uncertain Capacities
inferredcites →https://doi.org/10.1111/j.1467-8667.2011.00746.xopenalex-snapshot
Comparing Delay Minimization and Emissions Minimization in the Network Design Problem
inferredcites →https://doi.org/10.1111/j.1467-8667.2012.00791.xopenalex-snapshot
Integrated Planning of Supply Chain Networks and Multimodal Transportation Infrastructure Expansion: Model Development and Application to the Biofuel Industry
inferredcites →https://doi.org/10.1111/mice.12007openalex-snapshot
A Network Generalized Extreme Value Model for Route Choice Allowing Implicit Route Enumeration
inferredcites →https://doi.org/10.1126/science.153.3731.34openalex-snapshot
Dynamic Programming
inferredcites →https://doi.org/10.1137/s0895479896298130openalex-snapshot
Robust Solutions to Least-Squares Problems with Uncertain Data
inferredcites →https://doi.org/10.1137/s1052623496305717openalex-snapshot
Robust Solutions to Uncertain Semidefinite Programs
inferredcites →https://doi.org/10.1145/358172.358406openalex-snapshot
Optimal paths in graphs with stochastic or multidimensional weights
inferredcites →https://doi.org/10.1287/moor.23.4.769openalex-snapshot
Robust Convex Optimization
inferredcites →https://doi.org/10.1287/opre.1030.0065openalex-snapshot
The Price of Robustness
inferredcites →https://doi.org/10.1287/opre.1070.0441openalex-snapshot
A Robust Optimization Perspective on Stochastic Programming
inferredcites →https://doi.org/10.1287/opre.1110.1037openalex-snapshot
A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
inferredcites →https://doi.org/10.1287/opre.17.4.583openalex-snapshot
Shortest Paths in Probabilistic Graphs
inferredcites →https://doi.org/10.1287/opre.28.5.1122openalex-snapshot
The Stochastic Shortest Route Problem
inferredcites →https://doi.org/10.1287/trsc.19.1.75openalex-snapshot
Path Preferences and Optimal Paths in Probabilistic 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.28.4.309openalex-snapshot
The Variance-Constrained Shortest Path Problem
inferredcites →https://doi.org/10.1287/trsc.30.3.220openalex-snapshot
A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
inferredcites →https://doi.org/10.1287/trsc.34.2.198.12304openalex-snapshot
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
inferredcites →https://doi.org/10.1287/trsc.35.1.37.10141openalex-snapshot
A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
inferredcites →https://doi.org/10.1515/9781400831050openalex-snapshot
Robust Optimization
inferredcites →https://doi.org/10.2307/3010157openalex-snapshot
Robust Discrete Optimization and Its Applications.

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.4581195openalex-extracted
Navigating Uncertainty: A Consensus-Based Algorithm for Solving the Stochastic Canadian Traveler Problem
inferred← citeshttps://doi.org/10.1016/j.cie.2016.11.026openalex-snapshot
Risk-averse multi-product selective newsvendor problem with different market entry scenarios under CVaR criterion
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107096openalex-snapshot
Robust and Distributionally Robust Shortest Path problems: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.01.009openalex-snapshot
Wasserstein distributionally robust shortest path problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.04.046openalex-snapshot
Reliable pathfinding problems for a correlated network: A linear programming problem in a hypergraph
inferred← citeshttps://doi.org/10.1016/j.istruc.2023.105769openalex-snapshot
Effect of the soil slope on the cost-efficient optimum discrete design of reinforced concrete isolated footings
inferred← citeshttps://doi.org/10.1016/j.trb.2015.04.002openalex-snapshot
An exact algorithm for the mean–standard deviation shortest path problem
inferred← citeshttps://doi.org/10.1016/j.trb.2016.09.009openalex-snapshot
Parametric search for the bi-attribute concave shortest path problem
inferred← citeshttps://doi.org/10.1016/j.trb.2016.11.012openalex-snapshot
Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations
inferred← citeshttps://doi.org/10.1016/j.trb.2017.04.006openalex-snapshot
Lagrangian relaxation for the reliable shortest path problem with correlated link travel times
inferred← citeshttps://doi.org/10.1016/j.trb.2018.12.011openalex-snapshot
An algorithm for reliable shortest path problem with travel time correlations
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103390openalex-snapshot
Robust minimum fleet problem for autonomous and human-driven vehicles in on-demand ride services considering mixed operation zones
inferred← citeshttps://doi.org/10.1016/j.trc.2022.103866openalex-snapshot
Travel time reliability in transportation networks: A review of methodological developments
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103635openalex-snapshot
Reliable lifelong planning A*: Technique for re-optimizing reliable shortest paths when travel time distribution updating
inferred← citeshttps://doi.org/10.1016/j.trip.2021.100395openalex-snapshot
Adaptive routing behavior with real-time information under multiple travel objectives
inferred← citeshttps://doi.org/10.1061/jtepbs.teeng-7925openalex-snapshot
Integrating Railroad Crossing Blockage Information in First Responder Dispatching Route Planning
inferred← citeshttps://doi.org/10.1080/19392699.2019.1574262openalex-snapshot
Optimization of coal blending operations under uncertainty – robust optimization approach
inferred← citeshttps://doi.org/10.1080/21680566.2016.1169953openalex-snapshot
Most reliable path-finding algorithm for maximizing on-time arrival probability
inferred← citeshttps://doi.org/10.1093/oso/9780198856740.003.0003openalex-snapshot
Emergency Response: Navigable Networks and Optimal Routing in Hazardous Indoor Environments
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341736openalex-snapshot
Adaptive Reliable Shortest Path in Gaussian Process Regulated Environments
inferred← citeshttps://doi.org/10.1109/mits.2022.3146143openalex-snapshot
Railway Alignment Optimization Under Uncertainty With a Minimax Robust Method
inferred← citeshttps://doi.org/10.1109/tits.2017.2709798openalex-snapshot
Robust Shortest Path Problem With Distributional Uncertainty
inferred← citeshttps://doi.org/10.1109/tits.2021.3096829openalex-snapshot
CTD: Cascaded Temporal Difference Learning for the Mean-Standard Deviation Shortest Path Problem
inferred← citeshttps://doi.org/10.1109/tits.2021.3105415openalex-snapshot
GP3: Gaussian Process Path Planning for Reliable Shortest Path in Transportation Networks
inferred← citeshttps://doi.org/10.1111/exsy.12255openalex-snapshot
Meta‐heuristic multi‐ and many‐objective optimization techniques for solution of machine learning problems
inferred← citeshttps://doi.org/10.1111/mice.12197openalex-snapshot
Emergency Response in Complex Buildings: Automated Selection of Safest and Balanced Routes
inferred← citeshttps://doi.org/10.1111/mice.12236openalex-snapshot
Robust Optimal Lane Allocation for Isolated Intersections
inferred← citeshttps://doi.org/10.1111/mice.12239openalex-snapshot
Multi‐Objective Mathematical Programming Approach to Construction Laborer Assignment with Equity Consideration
inferred← citeshttps://doi.org/10.1111/mice.12260openalex-snapshot
Analytic Prioritization of Indoor Routes for Search and Rescue Operations in Hazardous Environments
inferred← citeshttps://doi.org/10.1111/mice.12460openalex-snapshot
An iterative learning approach for network contraction: Path finding problem in stochastic time-varying networks
inferred← citeshttps://doi.org/10.1155/2021/8375780openalex-snapshot
Transportation Path Optimization of Modern Logistics Distribution considering Hybrid Tabu Search Algorithm
inferred← citeshttps://doi.org/10.1155/2022/3734946openalex-snapshot
Green Building Project Cost Budgeting and Cost Control Integrating Interactive VR Genetic Algorithm
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27222openalex-snapshot
Planning with Multiple Action-Cost Estimates
inferred← citeshttps://doi.org/10.2139/ssrn.6854702openalex-snapshot
Modeling Flexible Robust Shortest Path Problem in Citywide Road Networks with Time-dependent Uncertainty
inferred← citeshttps://doi.org/10.3141/2498-09openalex-snapshot
Network Route Choice Model for Battery Electric Vehicle Drivers with Different Risk Attitudes
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.