Integer Programming Models

Integer Programming Models is a mathematical optimization framework within the class of linear programming models that specifically requires some or all decision variables to take integer values, thereby distinguishing it from continuous linear programming by enforcing discrete solution spaces essential for modeling indivisible activities or logical constraints in operations research problems.

1.9K

Publications

135.6K

Citations

4K

Authors

1.3K

Institutions

Publications per year

2017–2026

363

Authors

4K

  1. LA
    Laurence A. Wolsey

    UCLouvain, Belgium

    22 publications · 2.1K citations

    20

    h-index

  2. GL
    George L. Nemhauser

    Georgia Institute of Technology, United States

    17 publications · 4.2K citations

    16

    h-index

  3. FG
    Fred Glover

    University of Colorado Boulder, United States

    16 publications · 5.3K citations

    14

    h-index

  4. MS
    Martin Savelsbergh

    Georgia Institute of Technology, United States

    15 publications · 4.1K citations

    14

    h-index

  5. RG
    R. G. Jeroslow

    Georgia Institute of Technology, United States

    13 publications · 742 citations

    12

    h-index

1–5 of 4K

Venues

  1. Operations Research

    78 publications · 14.3K citations

    46

    h-index

  2. Management Science

    55 publications · 7.8K citations

    38

    h-index

  3. European Journal of Operational Research

    79 publications · 4K citations

    34

    h-index

  4. Mathematical Programming

    54 publications · 4K citations

    34

    h-index

  5. International Journal of Production Research

    48 publications · 2.1K citations

    25

    h-index

1–5