The Variance-Constrained Shortest Path Problem
From MaRDI portal
Publication:4834228
DOI10.1287/trsc.28.4.309zbMath0823.90130OpenAlexW2033564834MaRDI QIDQ4834228
Publication date: 28 May 1995
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.28.4.309
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (14)
Optimal path problems with second-order stochastic dominance constraints ⋮ Hazardous material transportation problems: a comprehensive overview of models and solution approaches ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Railroad transportation of dangerous goods: population exposure to airborne toxins ⋮ Analyzing the reachability problem in choice networks ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ A linear time algorithm for linearizing quadratic and higher-order shortest path problems ⋮ Reachability in choice networks ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ A branch-and-price approach for operational aircraft maintenance routing ⋮ Special cases of the quadratic shortest path problem ⋮ The quadratic shortest path problem: complexity, approximability, and solution methods ⋮ On Solving the Quadratic Shortest Path Problem ⋮ The linearization problem of a binary quadratic problem and its applications
This page was built for publication: The Variance-Constrained Shortest Path Problem