Integer Programming Relaxation is a mathematical optimization problem formed by removing the integrality constraints from an integer program, thereby allowing continuous solutions, while preserving the objective function and remaining constraints to provide a bounding approximation for the original discrete problem.
912
Publications
76.4K
Citations
1.8K
Authors
725
Institutions
Publications per year
2017–2026
141
Variants
Integer Programming Relaxation
Parents
Publications
912
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 912
Authors
1.8K
- LA
17
h-index
- MS
14
h-index
- GL
12
h-index
- RW
9
h-index
- FG
8
h-index
1–5 of 1.8K
Institutions
725
Georgia Institute of Technology
Atlanta, United States
28 h-index
68 publications
22.5K citations
Carnegie Mellon University
Pittsburgh, United States
25 h-index
59 publications
5.4K citations
Massachusetts Institute of Technology
Cambridge, United States
24 h-index
49 publications
3.9K citations
Princeton University
Princeton, United States
15 h-index
29 publications
1.9K citations
University of Bologna
Bologna, Italy
15 h-index
34 publications
2.3K citations
UCLouvain
Louvain-la-Neuve, Belgium
14 h-index
22 publications
7.2K citations
IBM (United States)
Armonk, United States
13 h-index
23 publications
2.4K citations
University of Florida
Gainesville, United States
11 h-index
16 publications
863 citations
1–8 of 725
Venues
- Mathematical Programming
77 publications · 7.5K citations
40
h-index
- Operations Research
46 publications · 8K citations
36
h-index
- European Journal of Operational Research
54 publications · 2.7K citations
27
h-index
- INFORMS journal on computing
39 publications · 2.5K citations
25
h-index
- Management Science
23 publications · 4.6K citations
21
h-index
1–5