Kim Allan Andersen

26 papers Journal 26
YearRankTypeTitle / Venue / Authors
2025 J jnl
Sensitivity Analysis of the Cost Coefficients in Multiobjective Integer Linear Optimization.
Manag. Sci.
Kim Allan Andersen, Trine Krogh Boomsma, Britta Efkes, Nicolas Forget
2023 J jnl
MILP Sensitivity Analysis for the Objective Function Coefficients.
INFORMS J. Optim.
Kim Allan Andersen, Trine Krogh Boomsma, Lars Relund Nielsen
2018 J jnl
A hybrid approach for biobjective optimization.
Discret. Optim.
Thomas R. Stidsen, Kim Allan Andersen
2014 J jnl
A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs.
Manag. Sci.
Thomas R. Stidsen, Kim Allan Andersen, Bernd Dammann
2014 J jnl
Ranking paths in stochastic time-dependent networks.
Eur. J. Oper. Res.
Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
2013 J jnl
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming.
Transp. Sci.
Tue Rauff Lind Christensen, Kim Allan Andersen, Andreas Klose
2010 J jnl
Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726].
Comput. Oper. Res.
Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen
2009 J jnl
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks.
Oper. Res. Lett.
Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott
2008 J jnl
An algorithm for ranking assignments using reoptimization.
Comput. Oper. Res.
Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen
2008 J jnl
The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results.
INFORMS J. Comput.
Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen
2007 J jnl
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search.
Comput. Oper. Res.
Christian Roed Pedersen, Rasmus V. Rasmussen, Kim Allan Andersen
2006 J jnl
Finding the
Oper. Res. Lett.
Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen
2005 J jnl
Applying the minimax criterion in stochastic recourse programs.
Eur. J. Oper. Res.
Morten Riis, Kim Allan Andersen
2005 J jnl
Finding the
Comput. Oper. Res.
Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
2004 J jnl
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives.
Eur. J. Oper. Res.
Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg
2004 J jnl
Multiperiod capacity expansion of a telecommunications connection with uncertain demand.
Comput. Oper. Res.
Morten Riis, Kim Allan Andersen
2003 J jnl
The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation.
Eur. J. Oper. Res.
Anders J. V. Skriver, Kim Allan Andersen
2002 J jnl
Capacitated Network Design with Uncertain Demand.
INFORMS J. Comput.
Morten Riis, Kim Allan Andersen
2001 J jnl
Easy Cases of Probabilistic Satisfiability.
Ann. Math. Artif. Intell.
Kim Allan Andersen, Daniele Pretolani
2000 J jnl
A label correcting approach for solving bicriterion shortest-path problems.
Comput. Oper. Res.
Anders J. V. Skriver, Kim Allan Andersen
1999 J jnl
Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs.
Int. J. Game Theory
Kim Allan Andersen, Mikael Lind
1998 J jnl
On consistency in probabilistic logic for logical formulas represented by B-hypertrees.
Eur. J. Oper. Res.
Kim Allan Andersen
1996 J jnl
A linear programming framework for logics of uncertainty.
Decis. Support Syst.
Kim Allan Andersen, John N. Hooker
1996 J jnl
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs.
Ann. Oper. Res.
Kim Allan Andersen, John N. Hooker
1996 J jnl
On bicriterion minimal spanning trees: An approximation.
Comput. Oper. Res.
Kim Allan Andersen, Kurt Jörnsten, Mikael Lind
1994 J jnl
Bayesian logic.
Decis. Support Syst.
Kim Allan Andersen, John N. Hooker