Pure Integer Programming

Pure Integer Programming is an optimization problem in the class of mathematical programming where all decision variables are restricted to integer values, distinguishing it from mixed-integer or continuous programming formulations.

90

Publications

10K

Citations

166

Authors

113

Institutions

Publications per year

2017–2026

10

Authors

166

  1. FS
    Frederick S. Hillier

    Stanford University, United States

    4 publications · 179 citations

    4

    h-index

  2. EB
    Egon Balas

    Carnegie Mellon University, United States

    3 publications · 278 citations

    3

    h-index

  3. JB
    Jean B. Lasserre

    Laboratoire d'Analyse et d'Architecture des Systèmes, France

    3 publications · 62 citations

    3

    h-index

  4. FG
    Fred Glover

    University of Colorado Boulder, United States

    3 publications · 4.5K citations

    3

    h-index

  5. AC
    Andrew C. Trapp

    Worcester Polytechnic Institute, United States

    2 publications · 54 citations

    2

    h-index

1–5 of 166

Venues

  1. Operations Research

    12 publications · 952 citations

    11

    h-index

  2. 6

    h-index

  3. Management Science

    5 publications · 701 citations

    5

    h-index

  4. Mathematical Programming

    4 publications · 514 citations

    4

    h-index

  5. European Journal of Operational Research

    3 publications · 72 citations

    3

    h-index

1–5