科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
K
Kim Allan Andersen
Aarhus University
15
H指数
42
论文数
884
被引数
0
相关解读
订阅
收录论文
15
发表时间
发表时间
IF
被引数
Ranking paths in stochastic time-dependent networks
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2014-08-01
14
OA
AI
Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele
分享
收藏
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
TRANSPORTATION SCIENCE
IF
4.8
2013-08-01
8
PRE
AI
Christensen, Tue R. L.; Andersen, Kim Allan; Klose, Andreas
分享
收藏
An algorithm for ranking assignments using reoptimization (vol 35, pg 3714, 2008)
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2010-02-01
2
PRE
AI
Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan
分享
收藏
An algorithm for ranking assignments using reoptimization
一种使用重新优化对作业进行排序的算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2008-11-01
24
OA
AI
Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan
分享
收藏
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2007-07-01
6
PRE
AI
Pedersen, Christian R.; Rasmussen, Rasmus V.; Andersen, Kim A.
分享
收藏
Applying the minimax criterion in stochastic recourse programs
在随机追索程序中应用minimax准则
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2005-09-01
18
OA
AI
Riis, M; Andersen, KA
分享
收藏
Finding the K shortest hyperpaths
找到K个最短的超路径
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2005-06-01
53
PRE
AI
Nielsen, LR; Andersen, KA; Pretolani, D
分享
收藏
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2004-08-01
4
PRE
AI
Skriver, AJV; Andersen, KA; Holmberg, K
分享
收藏
Multiperiod capacity expansion of a telecommunications connection with uncertain demand
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2004-08-01
22
PRE
AI
Riis, M; Andersen, KA
分享
收藏
The bicriterion semi-obnoxious location (BSL) problem solved by an ε-approximation
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2003-05-01
30
PRE
AI
Skriver, AJV; Andersen, KA
分享
收藏
A label correcting approach for solving bicriterion shortest-path problems
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2000-05-01
151
PRE
AI
Skriver, AJV; Andersen, KA
分享
收藏
On consistency in probabilistic logic for logical formulas represented by B-hypertrees
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
1998-08-01
1
PRE
AI
Andersen, KA
分享
收藏
On bicriterion minimal spanning trees: An approximation
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
1996-12-01
32
PRE
AI
Andersen, KA; Jornsten, K; Lind, M
分享
收藏
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
ANNALS OF OPERATIONS RESEARCH
IF
4.5
1996-08-01
2
PRE
AI
Andersen, KA; Hooker, JN
分享
收藏
A linear programming framework for logics of uncertainty
不确定性逻辑的线性规划框架
DECISION SUPPORT SYSTEMS
IF
6.8
1996-01-01
11
PRE
AI
Andersen, KA; Hooker, JN
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
J
John Hooker
H 指数: 46 · 论文数: 505
K
Kurt Jörnsten
H 指数: 27 · 论文数: 182
M
Mikael Lind
H 指数: 22 · 论文数: 225
K
Kaj Holmberg
H 指数: 22 · 论文数: 109
R
Rasmus V. Rasmussen
H 指数: 15 · 论文数: 38
查看更多