| Robust combinatorial optimization under convex and discrete cost uncertainty C Buchheim, J Kurtz EURO Journal on Computational Optimization 6 (3), 211-238, 2018 | 79 | 2018 |
| Min–max–min robust combinatorial optimization C Buchheim, J Kurtz Mathematical Programming 163, 1-23, 2017 | 74 | 2017 |
| Data-driven robust optimization using deep neural networks M Goerigk, J Kurtz Computers & Operations Research 151, 106087, 2023 | 33* | 2023 |
| Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty A Chassein, M Goerigk, J Kurtz, M Poss European Journal of Operational Research 279 (2), 308-319, 2019 | 31* | 2019 |
| Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions C Buchheim, J Kurtz Electronic Notes in Discrete Mathematics 52, 45-52, 2016 | 30 | 2016 |
| Oracle-based algorithms for binary two-stage robust optimization N Kämmerling, J Kurtz Computational Optimization and Applications 77 (2), 539-569, 2020 | 26 | 2020 |
| A robust approach to the capacitated vehicle routing problem with uncertain costs L Eufinger, J Kurtz, C Buchheim, U Clausen INFORMS Journal on Optimization 2 (2), 79-95, 2020 | 24 | 2020 |
| Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty C Buchheim, J Kurtz Discrete Optimization 28, 1-15, 2018 | 23* | 2018 |
| Radial eigenfunctions for the game-theoretic -Laplacian on a ball B Kawohl, S Krӧmer, J Kurtz | 19 | 2014 |
| Min–max–min robustness for combinatorial problems with discrete budgeted uncertainty M Goerigk, J Kurtz, M Poss Discrete Applied Mathematics 285, 707-725, 2020 | 15 | 2020 |
| Finding regions of counterfactual explanations via robust optimization D Maragno, J Kurtz, TE Röber, R Goedhart, ŞI Birbil, D den Hertog INFORMS Journal on Computing, 2024 | 11 | 2024 |
| An integer programming approach to deep neural networks with binary activation functions B Bah, J Kurtz arXiv preprint arXiv:2007.03326, 2020 | 11* | 2020 |
| Robust combinatorial optimization under budgeted–ellipsoidal uncertainty J Kurtz EURO Journal on Computational Optimization 6 (4), 315-337, 2018 | 6 | 2018 |
| Discrete optimization methods for group model selection in compressed sensing B Bah, J Kurtz, O Schaudt Mathematical Programming 190, 171-220, 2021 | 5 | 2021 |
| Efficient and robust mixed-integer optimization methods for training binarized deep neural networks J Kurtz, B Bah arXiv preprint arXiv:2110.11382, 2021 | 5 | 2021 |
| Neur2RO: neural two-stage robust optimization J Dumouchelle, E Julien, J Kurtz, EB Khalil arXiv preprint arXiv:2310.04345, 2023 | 3 | 2023 |
| Data-driven Prediction of Relevant Scenarios for Robust Combinatorial Optimization M Goerigk, J Kurtz arXiv preprint arXiv:2203.16642, 2022 | 3 | 2022 |
| Min-max-min robust combinatorial optimization J Kurtz | 3 | 2016 |
| Connections between Robust and Bilevel Optimization M Goerigk, J Kurtz, M Schmidt, J Thürauf | 2* | 2024 |
| Approximation Guarantees for Min-Max-Min Robust Optimization and -Adaptability Under Objective Uncertainty J Kurtz SIAM Journal on Optimization 34 (2), 2121-2149, 2024 | 1* | 2024 |
Marc GoerigkProfessor, Business Decisions and Data Sciece, University of Passau在 uni-passau.de 的电子邮件经过验证
