Integer Linear Programming

Integer Linear Programming is a mathematical optimization method within the class of linear programming problems in which the decision variables are restricted to integer values, distinguishing it from standard linear programming by enforcing integrality constraints on variables to model discrete decision-making scenarios.

6.5K

Publications

331.3K

Citations

14.1K

Authors

2.9K

Institutions

Publications per year

2017–2026

2.6K

Authors

14.1K

  1. IE
    Ignacio E. Grossmann

    Carnegie Mellon University, United States

    25 publications · 2K citations

    22

    h-index

  2. BM
    Biswanath Mukherjee

    University of California, Davis, United States

    27 publications · 1.8K citations

    21

    h-index

  3. KC
    Krishnendu Chakrabarty

    Duke University, United States

    30 publications · 3.1K citations

    20

    h-index

  4. DZ
    David Z. Pan

    The University of Texas at Austin, United States

    28 publications · 1.1K citations

    20

    h-index

  5. LG
    Lazaros G. Papageorgiou

    University College London, United Kingdom

    25 publications · 1.4K citations

    19

    h-index

1–5 of 14.1K

Venues

  1. IEEE Transactions on Power Systems

    167 publications · 20.7K citations

    78

    h-index

  2. IEEE Transactions on Smart Grid

    69 publications · 7.9K citations

    48

    h-index

  3. Operations Research

    81 publications · 14.9K citations

    48

    h-index

  4. Industrial & Engineering Chemistry Research

    139 publications · 7.4K citations

    47

    h-index

  5. International Journal of Production Research

    171 publications · 7.3K citations

    47

    h-index

1–5