Kim Allan Andersen

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 2

Top Topics

Branch And Bound Algorithm

Efficient Solutions

Mixed Integer Program

Top Venues

Discret. Optim.

INFORMS J. Optim.

Eur. J. Oper. Res.

Publications

Kim Allan Andersen, Trine Krogh Boomsma, Lars Relund Nielsen
MILP Sensitivity Analysis for the Objective Function Coefficients. INFORMS J. Optim. 5 (1) (2023)
Thomas R. Stidsen, Kim Allan Andersen
A hybrid approach for biobjective optimization. Discret. Optim. 28 (2018)
Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
Ranking paths in stochastic time-dependent networks. Eur. J. Oper. Res. 236 (3) (2014)
Thomas R. Stidsen, Kim Allan Andersen, Bernd Dammann
A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs. Manag. Sci. 60 (4) (2014)
Tue Rauff Lind Christensen, Kim Allan Andersen, Andreas Klose
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming. Transp. Sci. 47 (3) (2013)
Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen
Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]. Comput. Oper. Res. 37 (2) (2010)
Daniele 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) (2009)
Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen
The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results. INFORMS J. Comput. 20 (3) (2008)
Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen
An algorithm for ranking assignments using reoptimization. Comput. Oper. Res. 35 (11) (2008)
Christian Roed Pedersen, Rasmus V. Rasmussen, Kim Allan Andersen
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search. Comput. Oper. Res. 34 (7) (2007)
Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen
shortest hyperpaths using reoptimization. Oper. Res. Lett. 34 (2) (2006)
Morten Riis, Kim Allan Andersen
Applying the minimax criterion in stochastic recourse programs. Eur. J. Oper. Res. 165 (3) (2005)
Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
shortest hyperpaths. Comput. Oper. Res. 32 (2005)
Morten Riis, Kim Allan Andersen
Multiperiod capacity expansion of a telecommunications connection with uncertain demand. Comput. Oper. Res. 31 (9) (2004)
Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives. Eur. J. Oper. Res. 156 (3) (2004)
Anders J. V. Skriver, Kim Allan Andersen
The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation. Eur. J. Oper. Res. 146 (3) (2003)
Morten Riis, Kim Allan Andersen
Capacitated Network Design with Uncertain Demand. INFORMS J. Comput. 14 (3) (2002)
Kim Allan Andersen, Daniele Pretolani
Easy Cases of Probabilistic Satisfiability. Ann. Math. Artif. Intell. 33 (1) (2001)
Anders J. V. Skriver, Kim Allan Andersen
A label correcting approach for solving bicriterion shortest-path problems. Comput. Oper. Res. 27 (6) (2000)
Kim Allan Andersen, Mikael Lind
Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs. Int. J. Game Theory 28 (4) (1999)
Kim Allan Andersen
On consistency in probabilistic logic for logical formulas represented by B-hypertrees. Eur. J. Oper. Res. 108 (3) (1998)
Kim Allan Andersen, Kurt Jörnsten, Mikael Lind
On bicriterion minimal spanning trees: An approximation. Comput. Oper. Res. 23 (12) (1996)