科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
A
André Chassein
University of Kaiserslautern
11
H指数
43
论文数
310
被引数
0
相关解读
订阅
收录论文
10
发表时间
发表时间
IF
被引数
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
具有预算不确定性的组合问题的min-max-min鲁棒性的更快算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-12-01
12
OA
AI
Chassein, Andre; Goerigk, Marc; Kurtz, Jannis; Poss, Michael
分享
收藏
Algorithms and uncertainty sets for data-driven robust shortest path problems
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-04-01
47
OA
AI
Chassein, Andre; Dokka, Trivikram; Goerigk, Marc
分享
收藏
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2018-09-01
3
OA
AI
Chassein, Andre; Goerigk, Marc
分享
收藏
The quadratic shortest path problem: complexity, approximability, and solution methods
二次最短路径问题: 复杂性、逼近性和求解方法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2018-07-01
32
OA
AI
Rostami, Borzou; Chassein, Andre; Hopf, Michael; Frey, Davide; Buchheim, Christoph; Malucelli, Federico; Goerigk, Marc
分享
收藏
On recoverable and two-stage robust selection problems with budgeted uncertainty
关于具有预算不确定性的可恢复和两阶段鲁棒选择问题
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2018-03-01
19
OA
AI
Chassein, Andre; Goerigk, Marc; Kasperski, Adam; Zielinski, Pawel
分享
收藏
Variable-sized uncertainty and inverse problems in robust optimization
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2018-01-01
16
OA
AI
Chassein, Andre; Goerigk, Marc
分享
收藏
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2017-04-01
23
OA
AI
Chassein, Andre; Goerigk, Marc
分享
收藏
A bicriteria approach to robust optimization
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2016-02-01
12
OA
AI
Chassein, Andre; Goerigk, Marc
分享
收藏
The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2015-12-01
28
PRE
AI
Kien Trung Nguyen; Chassein, Andre
分享
收藏
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
minmax后悔优化中点解的新界及其在鲁棒最短路径问题中的应用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2015-08-01
20
OA
AI
Chassein, Andre B.; Goerigk, Marc
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
F
Federico Malucelli
H 指数: 29 · 论文数: 170
M
Marc Goerigk
H 指数: 23 · 论文数: 184
M
Michaël Poss
H 指数: 22 · 论文数: 134
A
Adam Kasperski
H 指数: 21 · 论文数: 148
C
Christoph Buchheim
H 指数: 21 · 论文数: 207
查看更多