Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Chassein, André
48  Ergebnisse:
Personensuche X
?
1

On the complexity of min–max–min robustness with two altern..:

Chassein, André ; Goerigk, Marc
Discrete Applied Mathematics.  296 (2021)  - p. 141-163 , 2021
Link: https://doi.org/10.1016/..
 
?
2

Approximating combinatorial optimization problems with the ..:

Chassein, André ; Goerigk, Marc ; Kasperski, Adam.
European Journal of Operational Research.  286 (2020)  3 - p. 828-838 , 2020
Link: https://doi.org/10.1016/..
 
?
3

Algorithms and uncertainty sets for data-driven robust shor..:

Chassein, André ; Dokka, Trivikram ; Goerigk, Marc
European Journal of Operational Research.  274 (2019)  2 - p. 671-686 , 2019
Link: https://doi.org/10.1016/..
 
?
4

Faster algorithms for min-max-min robustness for combinator..:

Chassein, André ; Goerigk, Marc ; Kurtz, Jannis.
European Journal of Operational Research.  279 (2019)  2 - p. 308-319 , 2019
Link: https://doi.org/10.1016/..
 
?
5

On the complexity of robust geometric programming with poly..:

Chassein, André ; Goerigk, Marc
Operations Research Letters.  47 (2019)  1 - p. 21-24 , 2019
Link: https://doi.org/10.1016/..
 
?
6

Complexity of strict robust integer minimum cost flow probl..:

Chassein, André ; Kinscherff, Anika
Computers & Operations Research.  104 (2019)  - p. 228-238 , 2019
Link: https://doi.org/10.1016/..
 
?
7

The quadratic shortest path problem: complexity, approximab..:

Rostami, Borzou ; Chassein, André ; Hopf, Michael...
European Journal of Operational Research.  268 (2018)  2 - p. 473-485 , 2018
Link: https://doi.org/10.1016/..
 
?
8

Variable-sized uncertainty and inverse problems in robust o..:

Chassein, André ; Goerigk, Marc
European Journal of Operational Research.  264 (2018)  1 - p. 17-28 , 2018
Link: https://doi.org/10.1016/..
 
?
9

On recoverable and two-stage robust selection problems with..:

Chassein, André ; Goerigk, Marc ; Kasperski, Adam.
European Journal of Operational Research.  265 (2018)  2 - p. 423-436 , 2018
Link: https://doi.org/10.1016/..
 
?
10

Compromise solutions for robust combinatorial optimization ..:

Chassein, André ; Goerigk, Marc
European Journal of Operational Research.  269 (2018)  2 - p. 544-555 , 2018
Link: https://doi.org/10.1016/..
 
?
11

On scenario aggregation to approximate robust combinatorial..:

Chassein, André ; Goerigk, Marc
Optimization Letters.  12 (2017)  7 - p. 1523-1533 , 2017
Link: https://doi.org/10.1007/..
 
?
12

Minmax regret combinatorial optimization problems with elli..:

Chassein, André ; Goerigk, Marc
European Journal of Operational Research.  258 (2017)  1 - p. 58-69 , 2017
Link: https://doi.org/10.1016/..
 
?
13

Capacitated network design games with weighted players:

Chassein, André ; Krumke, Sven O. ; Thielen, Clemens
Networks.  68 (2016)  2 - p. 141-158 , 2016
Link: https://doi.org/10.1002/..
 
?
14

A bicriteria approach to robust optimization:

Chassein, André ; Goerigk, Marc
Computers & Operations Research.  66 (2016)  - p. 181-189 , 2016
Link: https://doi.org/10.1016/..
 
?
15

The inverse convex ordered 1-median problem on trees under ..:

Nguyen, Kien Trung ; Chassein, André
European Journal of Operational Research.  247 (2015)  3 - p. 774-781 , 2015
Link: https://doi.org/10.1016/..
 
1-15