Lars Relund Nielsen Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott: Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Oper. Res. Lett. 37(3): 201-205 (2009)
2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen: An algorithm for ranking assignments using reoptimization. Computers & OR 35(11): 3714-3726 (2008)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen: The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results. INFORMS Journal on Computing 20(3): 400-411 (2008)
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Relund Nielsen, Anders Ringgaard Kristensen: Finding the K. European Journal of Operational Research 175(2): 1164-1179 (2006)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen: Finding the K shortest hyperpaths using reoptimization. Oper. Res. Lett. 34(2): 155-164 (2006)
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani: Finding the K shortest hyperpaths. Computers & OR 32: 1477-1497 (2005)

Coauthor Index

1Kim Allan Andersen [1] [2] [4] [5] [6]
2Matthias Ehrgott [6]
3Anders Ringgaard Kristensen [3]
4Christian Roed Pedersen [4] [5]
5Daniele Pretolani [1] [2] [6]

Colors in the list of coauthors

Copyright © Tue Dec 22 17:48:42 2009 by Michael Ley (ley@uni-trier.de)