Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
DOI10.1016/J.ORL.2009.02.001zbMATH Open1167.90647OpenAlexW2077614255MaRDI QIDQ833580FDOQ833580
Authors: D. Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott 
Publication date: 14 August 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.02.001
Recommendations
- Bicriterion shortest paths in stochastic time-dependent networks
- Multicriteria adaptive paths in stochastic, time-varying networks
- Ranking paths in stochastic time-dependent networks
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
- Bicriterion shortest hyperpaths in random time-dependent networks
shortest pathsmulti-objective programminghistory-adaptive strategiesstochastic time-dependent networkstime-adaptive strategies
Cites Work
- Multicriteria Optimization
- A directed hypergraph model for random time dependent shortest paths
- Multicriteria adaptive paths in stochastic, time-varying networks
- Bicriterion shortest hyperpaths in random time-dependent networks
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Cited In (6)
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
- Bicriterion shortest paths in stochastic time-dependent networks
- Title not available (Why is that?)
- Finding hypernetworks in directed hypergraphs
- Efficient routing strategy with transmission history information and its surrogate analysis
- Multicriteria adaptive paths in stochastic, time-varying networks
This page was built for publication: Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833580)
