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

Authors

457

  1. JK
    Jannis Kurtz

    TU Dortmund University, Germany

    5 publications · 153 citations

    5

    h-index

  2. CB
    Christoph Buchheim

    TU Dortmund University, Germany

    5 publications · 153 citations

    5

    h-index

  3. MP
    Michaël Poss

    Centre National de la Recherche Scientifique, France

    5 publications · 180 citations

    5

    h-index

  4. SV
    Stefan Voß

    Universität Hamburg, Germany

    3 publications · 105 citations

    3

    h-index

  5. CK
    Changhyun Kwon

    University of South Florida, United States

    3 publications · 93 citations

    3

    h-index

1–5 of 457

Venues

  1. European Journal of Operational Research

    17 publications · 1.2K citations

    13

    h-index

  2. Transportation Science

    7 publications · 692 citations

    7

    h-index

  3. Computers & Operations Research

    7 publications · 190 citations

    7

    h-index

  4. Operations Research

    5 publications · 557 citations

    5

    h-index

  5. INFORMS journal on computing

    4 publications · 323 citations

    4

    h-index

1–5