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
Parents
90
1–5 of 90
166
4
h-index
3
h-index
Laboratoire d'Analyse et d'Architecture des Systèmes, France
3 publications · 62 citations
3
h-index
3
h-index
2
h-index
1–5 of 166
113

Centre National de la Recherche Scientifique
Paris, France
5 h-index
6 publications
216 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
6 publications
511 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
4 publications
202 citations

Laboratoire d'Analyse et d'Architecture des Systèmes
Toulouse, France
4 h-index
5 publications
144 citations
Stanford University
Stanford, United States
4 h-index
4 publications
179 citations
Yale University
New Haven, United States
3 h-index
3 publications
51 citations
University of Colorado Boulder
Boulder, United States
3 h-index
3 publications
4.5K citations
University of Lisbon
Lisbon, Portugal
2 h-index
2 publications
46 citations
1–8 of 113
12 publications · 952 citations
11
h-index
6 publications · 334 citations
6
h-index
5 publications · 701 citations
5
h-index
4 publications · 514 citations
4
h-index
3 publications · 72 citations
3
h-index
1–5