A directed hypergraph model for random time dependent shortest paths
From MaRDI portal
Publication:1569934
DOI10.1016/S0377-2217(99)00259-3zbMATH Open0967.90013MaRDI QIDQ1569934FDOQ1569934
Authors: D. Pretolani 
Publication date: 9 July 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Bicriterion shortest hyperpaths in random time-dependent networks
- scientific article; zbMATH DE number 4053318
- Shortest paths in piecewise continuous time-dependent networks
- A random graph model driven by time-dependent branching dynamics
- scientific article
- Bicriterion shortest paths in stochastic time-dependent networks
- Shortest Journeys in Directed Temporal Graphs
- Time version of the shortest path problem in a stochastic-flow network
- Dynamic single-source shortest paths in Erdős-Rényi random graphs
Cites Work
- Directed hypergraphs and applications
- Least possible time paths in stochastic, time-varying networks.
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
- Stochastic shortest path problems with recourse
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- An Analysis of Stochastic Shortest Path Problems
- Equilibrium traffic assignment for large scale transit networks
- Minimum weight paths in time-dependent networks
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
- On the complexity of strongly connected components in directed hypergraphs
- Partially dynamic maintenance of minimum weight hyperpaths
- Optimal information location for adaptive routing
- Bicriterion shortest paths in stochastic time-dependent networks
- Effects of countdown displays in public transport route choice under severe overcrowding
- Dynamic graph generation for the shortest path problem in time expanded networks
- Random recursive hypergraphs
- Title not available (Why is that?)
- Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
- Multicriteria stochastic shortest path problem for electric vehicles
- Finding hypernetworks in directed hypergraphs
- Fuzzy logic programs as hypergraphs. Termination results
- PH-graphs for analyzing shortest path problems with correlated traveling times
- Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks
- Flow hypergraph reducibility
- Bicriterion shortest hyperpaths in random time-dependent networks
- Finding the \(K\) shortest hyperpaths
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- Ranking paths in stochastic time-dependent networks
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Multicriteria adaptive paths in stochastic, time-varying networks
- Finding the \(K\) best policies in a finite-horizon Markov decision process
This page was built for publication: A directed hypergraph model for random time dependent shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569934)
