Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks
Year of publication: |
2008-08-26
|
---|---|
Authors: | Pretolani, Daniele ; Nielsen, Lars Relund ; Andersen, Kim Allan ; Ehrgott, Matthias |
Institutions: | Ehrvervøkonomisk Institut, Institut for Økonomi |
Subject: | Multiple objective programming | shortest paths | stochastic |
-
A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
Pretolani, Daniele, (2006)
-
Experiences with a Simplified Microsimulation for the Dallas/Fort Worth Area
Rickert, M., (1997)
-
A faster capacity scaling algorithm for minimum cost submodular flow
FLEISCHER, Lisa, (1999)
- More ...
-
K shortest paths in stochastic time-dependent networks
Nielsen, Lars Relund, (2004)
-
A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
Pretolani, Daniele, (2006)
-
Finding the K shortest hyperpaths using reoptimization
Nielsen, Lars Relund, (2004)
- More ...