Kim Allan Andersen

According to our database, Kim Allan Andersen authored at least 25 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

MILP Sensitivity Analysis for the Objective Function Coefficients.

Kim Allan Andersen, Trine Krogh Boomsma, Lars Relund Nielsen

INFORMS J. Optim., January, 2023

2018

A hybrid approach for biobjective optimization.

Thomas R. Stidsen, Kim Allan Andersen

Discret. Optim., 2018

2014

A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs.

Thomas R. Stidsen, Kim Allan Andersen, Bernd Dammann

Manag. Sci., 2014

Ranking paths in stochastic time-dependent networks.

Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani

Eur. J. Oper. Res., 2014

2013

Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming.

Tue Rauff Lind Christensen, Kim Allan Andersen, Andreas Klose

Transp. Sci., 2013

2010

Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726].

Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen

Comput. Oper. Res., 2010

2009

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks.

Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott

Oper. Res. Lett., 2009

2008

The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results.

Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen

INFORMS J. Comput., 2008

An algorithm for ranking assignments using reoptimization.

Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen

Comput. Oper. Res., 2008

2007

Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search.

Christian Roed Pedersen, Rasmus V. Rasmussen, Kim Allan Andersen

Comput. Oper. Res., 2007

2006

Finding the <i>K</i> shortest hyperpaths using reoptimization.

Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen

Oper. Res. Lett., 2006

2005

Applying the minimax criterion in stochastic recourse programs.

Morten Riis, Kim Allan Andersen

Eur. J. Oper. Res., 2005

Finding the <i>K</i> shortest hyperpaths.

Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani

Comput. Oper. Res., 2005

2004

Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives.

Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg

Eur. J. Oper. Res., 2004

Multiperiod capacity expansion of a telecommunications connection with uncertain demand.

Morten Riis, Kim Allan Andersen

Comput. Oper. Res., 2004

2003

The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation.

Anders J. V. Skriver, Kim Allan Andersen

Eur. J. Oper. Res., 2003

2002

Capacitated Network Design with Uncertain Demand.

Morten Riis, Kim Allan Andersen

INFORMS J. Comput., 2002

2001

Easy Cases of Probabilistic Satisfiability.

Kim Allan Andersen, Daniele Pretolani

Ann. Math. Artif. Intell., 2001

2000

A label correcting approach for solving bicriterion shortest-path problems.

Anders J. V. Skriver, Kim Allan Andersen

Comput. Oper. Res., 2000

1999

Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs.

Kim Allan Andersen, Mikael Lind

Int. J. Game Theory, 1999

1998

On consistency in probabilistic logic for logical formulas represented by B-hypertrees.

Kim Allan Andersen

Eur. J. Oper. Res., 1998

1996

A linear programming framework for logics of uncertainty.

Kim Allan Andersen, John N. Hooker

Decis. Support Syst., 1996

On bicriterion minimal spanning trees: An approximation.

Kim Allan Andersen, Kurt Jörnsten, Mikael Lind

Comput. Oper. Res., 1996

Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs.

Kim Allan Andersen, John N. Hooker

Ann. Oper. Res., 1996

1994

Bayesian logic.

Kim Allan Andersen, John N. Hooker

Decis. Support Syst., 1994