Discrete Optimization

Discrete Optimization is a branch of optimization that focuses on finding optimal solutions to problems where the set of feasible solutions is discrete or can be reduced to a discrete set, distinguishing it from continuous optimization by its reliance on combinatorial structures and finite solution spaces.

7.8K

Publications

545.2K

Citations

12.7K

Authors

2.9K

Institutions

Publications per year

2017–2026

1.8K

Authors

12.7K

  1. LA
    Laurence A. Wolsey

    UCLouvain, Belgium

    45 publications · 9.7K citations

    34

    h-index

  2. FG
    Fred Glover

    University of Colorado Boulder, United States

    50 publications · 9.7K citations

    29

    h-index

  3. QP
    Quan-Ke Pan

    Liaocheng University, China

    30 publications · 3.9K citations

    26

    h-index

  4. HD
    Hanif D. Sherali

    Virginia Tech, United States

    28 publications · 2.2K citations

    24

    h-index

  5. GL
    George L. Nemhauser

    Georgia Institute of Technology, United States

    31 publications · 10.1K citations

    23

    h-index

1–5 of 12.7K

Venues

  1. Operations Research

    254 publications · 35.4K citations

    88

    h-index

  2. Mathematical Programming

    224 publications · 26K citations

    77

    h-index

  3. IEEE Transactions on Power Systems

    145 publications · 16.6K citations

    69

    h-index

  4. European Journal of Operational Research

    289 publications · 17.4K citations

    64

    h-index

  5. Management Science

    123 publications · 16.2K citations

    64

    h-index

1–5