Kim Allan Andersen

Available identifiers

zbMath Open andersen.kim-allanMaRDI QIDQ732916

List of research outcomes

Publication	Date of Publication	Type
Easy cases of probabilistic satisfiability	2015-06-17	Paper
Ranking paths in stochastic time-dependent networks	2015-02-03	Paper
The bicriterion multimodal assignment problem: introduction, analysis, and experimental results	2012-07-28	Paper
Capacitated network design with uncertain demand	2012-05-30	Paper
A Tabu Search Approach to Clustering	2011-04-07	Paper
Bicriterion Shortest Paths in Stochastic Time-Dependent Networks	2009-12-04	Paper
Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]	2009-10-15	Paper
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks	2009-08-14	Paper
An algorithm for ranking assignments using reoptimization	2008-04-28	Paper
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search	2007-02-19	Paper
Applying the minimax criterion in stochastic recourse programs	2005-04-21	Paper
Finding the \(K\) shortest hyperpaths	2005-02-22	Paper
Multiperiod capacity expansion of a telecommunications connection with uncertain demand	2004-10-14	Paper
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives	2004-08-19	Paper
Bicriterion shortest hyperpaths in random time-dependent networks	2004-05-27	Paper
The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation	2003-04-28	Paper
A label correcting approach for solving bicriterion shortest-path problems	2001-03-04	Paper
On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees	2000-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q3840285	2000-09-27	Paper
Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs	2000-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q3840282	1998-08-10	Paper
On bicriterion minimal spanning trees: An approximation	1997-07-15	Paper
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs	1996-11-19	Paper
Characterizing consistency in probabilistic logic for a class of Horn clauses	1994-12-11	Paper

Research outcomes over time

This page was built for person: Kim Allan Andersen