K shortest paths in stochastic time-dependent networks
Download full text from publisher
References listed on IDEAS
- Pretolani, Daniele, 2000. "A directed hypergraph model for random time dependent shortest paths," European Journal of Operational Research, Elsevier, vol. 123(2), pages 315-324, June.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Nielsen, Lars Relund & Andersen, Kim Allan & Pretolani, Daniele, 2006. "Bicriterion a priori route choice in stochastic time-dependent networks," CORAL Working Papers L-2006-10, University of Aarhus, Aarhus School of Business, Department of Business Studies.
- Nielsen, Lars Relund & Kristensen, Anders Ringgaard, 2006. "Finding the K best policies in a finite-horizon Markov decision process," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1164-1179, December.
More about this item
KeywordsShortest paths; K shortest paths; stochastic time-dependent networks; routing; directed hypergraphs;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hhb:aarbls:2004-005. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Helle Vinbaek Stenholt). General contact details of provider: http://edirc.repec.org/data/ifhhadk.html .