Andersen Kim Allan

Kim Allan Andersen

Information about the author Kim Allan Andersen will soon be added to the site.
Found 13 papers in total
Solving the Single‐Sink, Fixed‐Charge, Multiple‐Choice Transportation Problem by Dynamic Programming
Solving the Single‐Sink, Fixed‐Charge, Multiple‐Choice Transportation Problem by Dynamic Programming
2013
This paper considers a minimum‐cost network flow problem in a bipartite graph...
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
2009
We compare two different models for multicriterion routing in stochastic...
The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
2008
We consider the bicriterion multimodal assignment problem, which is a new...
Bicriterion shortest hyperpaths in random time-dependent networks
Bicriterion shortest hyperpaths in random time-dependent networks
2003
In relevant application areas, such as transportation and telecommunications, there...
Bicriterion shortest hyperpaths in random time-dependent networks
Bicriterion shortest hyperpaths in random time-dependent networks
2003
In relevant application areas, such as transportation and telecommunications, there...
Applying the minimax criterion in stochastic recourse programs
Applying the minimax criterion in stochastic recourse programs
2005
We consider an optimization problem in which some uncertain parameters are replaced by...
Finding the K shortest hyperpaths using reoptimization
Finding the K shortest hyperpaths using reoptimization
2006
We present some reoptimization techniques for computing (shortest) hyperpath weights...
Finding the K shortest hyperpaths
Finding the K shortest hyperpaths
2005
The K shortest paths problem has been extensively studied for many years. Efficient...
Bicriteria network location problems with criteria dependent lengths and minisum objectives
Bicriteria network location problems with criteria dependent lengths and minisum objectives
2004
We present a new location model, which is a generalization of the bicriteria median...
Multiperiod capacity expansion of a telecommunications connection with uncertain demand
Multiperiod capacity expansion of a telecommunications connection with uncertain demand
2004
We consider multiperiod capacity expansion of a telecommunications connection with...
The bicriterion semi-obnoxious location problem solved by an ε-approximation
The bicriterion semi-obnoxious location problem solved by an ε-approximation
2003
Locating an obnoxious (undesirable) facility is often modeled by the maximin or...
Capacitated network design with uncertain demand
Capacitated network design with uncertain demand
2002
We consider a capacity-expansion problem arising in the design of telecommunication...
On bicriterion minimal spanning trees: An approximation
On bicriterion minimal spanning trees: An approximation
1996
In this paper the authors focus on the problem of computing the set of efficient...
Papers per page: