dblp.uni-trier.dewww.uni-trier.de

Kim Allan Andersen Vis

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

*2009
14EEDaniele 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
13EEChristian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen: An algorithm for ranking assignments using reoptimization. Computers & OR 35(11): 3714-3726 (2008)
12EEChristian 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)
2007
11EEChristian Roed Pedersen, Rasmus V. Rasmussen, Kim Allan Andersen: Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search. Computers & OR 34(7): 2025-2042 (2007)
2006
10EELars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen: Finding the K shortest hyperpaths using reoptimization. Oper. Res. Lett. 34(2): 155-164 (2006)
2005
9EELars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani: Finding the K shortest hyperpaths. Computers & OR 32: 1477-1497 (2005)
8EEMorten Riis, Kim Allan Andersen: Applying the minimax criterion in stochastic recourse programs. European Journal of Operational Research 165(3): 569-584 (2005)
2004
7EEMorten Riis, Kim Allan Andersen: Multiperiod capacity expansion of a telecommunications connection with uncertain demand. Computers & OR 31(9): 1427-1436 (2004)
6EEAnders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg: Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives. European Journal of Operational Research 156(3): 541-549 (2004)
2003
5EEAnders J. V. Skriver, Kim Allan Andersen: The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation. European Journal of Operational Research 146(3): 517-528 (2003)
2002
4EEMorten Riis, Kim Allan Andersen: Capacitated Network Design with Uncertain Demand. INFORMS Journal on Computing 14(3): 247-260 (2002)
2001
3 Kim Allan Andersen, Daniele Pretolani: Easy Cases of Probabilistic Satisfiability. Ann. Math. Artif. Intell. 33(1): 69-91 (2001)
2000
2EEAnders J. V. Skriver, Kim Allan Andersen: A label correcting approach for solving bicriterion shortest-path problems. Computers & OR 27(6): 507-524 (2000)
1996
1EEKim Allan Andersen, Kurt Jörnsten, Mikael Lind: On bicriterion minimal spanning trees: An approximation. Computers & OR 23(12): 1171-1182 (1996)

Coauthor Index

1Matthias Ehrgott [14]
2Kaj Holmberg [6]
3Kurt Jörnsten (Kurt Jørnsten) [1]
4Mikael Lind [1]
5Lars Relund Nielsen [9] [10] [12] [13] [14]
6Christian Roed Pedersen [11] [12] [13]
7Daniele Pretolani [3] [9] [10] [14]
8Rasmus V. Rasmussen [11]
9Morten Riis [4] [7] [8]
10Anders J. V. Skriver [2] [5] [6]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)