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
1.9K
Branch-and-Price: Column Generation for Solving Huge Integer Programs
Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser et al. · Operations Research · 1998 · 2.2K citations
1–5 of 1.9K
4K
20
h-index
16
h-index
14
h-index
14
h-index
12
h-index
1–5 of 4K
1.3K
Georgia Institute of Technology
Atlanta, United States
33 h-index
92 publications
19.7K citations
Carnegie Mellon University
Pittsburgh, United States
29 h-index
87 publications
8.1K citations
Massachusetts Institute of Technology
Cambridge, United States
28 h-index
58 publications
4.9K citations
University of Wisconsin–Madison
Madison, United States
21 h-index
50 publications
2.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
20 h-index
42 publications
2.2K citations
University of Michigan
Ann Arbor, United States
17 h-index
25 publications
1.9K citations

University of Toronto
Toronto, Canada
17 h-index
36 publications
2K citations

Pennsylvania State University
State College, United States
16 h-index
34 publications
1.3K citations
1–8 of 1.3K
78 publications · 14.3K citations
46
h-index
55 publications · 7.8K citations
38
h-index
79 publications · 4K citations
34
h-index
54 publications · 4K citations
34
h-index
48 publications · 2.1K citations
25
h-index
1–5