Combinatorial Optimization

Combinatorial Optimization is a branch of optimization that consists of finding an optimal object from a finite set of discrete possibilities, typically characterized by integer or binary variables and governed by combinatorial structures such as graphs, matroids, or permutations.

61.7K

Publications

3.9M

Citations

81.6K

Authors

8.6K

Institutions

Publications per year

2017–2026

17.2K

Authors

81.6K

  1. QP
    Quan-Ke Pan

    Liaocheng University, China

    163 publications · 16.4K citations

    81

    h-index

  2. GL
    Gilbert Laporte

    HEC Montréal, Canada

    185 publications · 20.6K citations

    74

    h-index

  3. LW
    Ling Wang

    Tsinghua University, China

    131 publications · 13.3K citations

    71

    h-index

  4. IE
    Ignacio E. Grossmann

    Carnegie Mellon University, United States

    140 publications · 13K citations

    70

    h-index

  5. LG
    Liang Gao

    Huazhong University of Science and Technology, China

    156 publications · 12.4K citations

    66

    h-index

1–5 of 81.6K

Venues

  1. European Journal of Operational Research

    2.5K publications · 185K citations

    183

    h-index

  2. Operations Research

    911 publications · 127.3K citations

    175

    h-index

  3. IEEE Transactions on Power Systems

    534 publications · 71.6K citations

    147

    h-index

  4. Computers & Operations Research

    1.6K publications · 107.7K citations

    147

    h-index

  5. Mathematical Programming

    717 publications · 71.3K citations

    131

    h-index

1–5