Robust Combinatorial Optimization
Robust Combinatorial Optimization is a methodology in optimization theory that addresses combinatorial problems under uncertainty by seeking solutions that remain feasible and near-optimal for all possible realizations of uncertain parameters within a predefined uncertainty set.
180
Publications
8.5K
Citations
457
Authors
278
Institutions
Publications per year
2017–2026
73
Parents
180
Maryam Karimi-Mamaghan, Mehrdad Mohammadi, Patrick Meyer et al. · European Journal of Operational Research · 2021 · 436 citations · Full text
1–5 of 180
457
5
h-index
5
h-index
5
h-index
3
h-index
3
h-index
1–5 of 457
278

Centre National de la Recherche Scientifique
Paris, France
10 h-index
13 publications
2K citations
Université de Technologie de Compiègne
Compiègne, France
5 h-index
6 publications
270 citations
RWTH Aachen University
Aachen, Germany
5 h-index
10 publications
319 citations
National University of Singapore
Singapore, Singapore
4 h-index
6 publications
457 citations
TU Dortmund University
Dortmund, Germany
4 h-index
8 publications
192 citations
The University of Texas at Austin
Austin, United States
4 h-index
4 publications
298 citations
University of Lisbon
Lisbon, Portugal
3 h-index
5 publications
644 citations
University of Kaiserslautern
Kaiserslautern, Germany
3 h-index
4 publications
66 citations
1–8 of 278
17 publications · 1.2K citations
13
h-index
7 publications · 692 citations
7
h-index
7 publications · 190 citations
7
h-index
5 publications · 557 citations
5
h-index
4 publications · 323 citations
4
h-index
1–5