Canyam
AI summaries for academic research
Home
Literature Help
Subscribe
Favorites
Tools
Analysis
Summary
Patents
Patent Payment
Patent Search
Not logged in
Back
A
André Chassein
University of Kaiserslautern
11
H-index
43
Paper Count
310
Citation Count
0
Related Insights
Subscribe
Published Papers
10
Publication Date
Publication Date
Impact Factor
Citations
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-12-01
12
OA
AI
Chassein, Andre; Goerigk, Marc; Kurtz, Jannis; Poss, Michael
Share
Save
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
Share
Save
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
Share
Save
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
Share
Save
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
Share
Save
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
Share
Save
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
Share
Save
A bicriteria approach to robust optimization
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2016-02-01
12
OA
AI
Chassein, Andre; Goerigk, Marc
Share
Save
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
Share
Save
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2015-08-01
20
OA
AI
Chassein, Andre B.; Goerigk, Marc
Share
Save
Research Directions
The data has not been retrieved yet.
Co-authors
Cooperation Journals
F
Federico Malucelli
H-index: 29 · Papers: 170
M
Marc Goerigk
H-index: 23 · Papers: 184
M
Michaël Poss
H-index: 22 · Papers: 135
A
Adam Kasperski
H-index: 21 · Papers: 148
C
Christoph Buchheim
H-index: 21 · Papers: 207
View more