Cutting Planes is a mathematical optimization method that belongs to the class of exact algorithms for solving integer programming problems, distinguished by its iterative addition of linear constraints—called cuts—that eliminate non-integer solutions without removing feasible integer solutions.
662
Publications
43.7K
Citations
1.2K
Authors
505
Institutions
Publications per year
2017–2026
72
Parents
Publications
662
1–5 of 662
Authors
1.2K
- JG
12
h-index
- LA
11
h-index
- MH
11
h-index
- SD
11
h-index
- EB
10
h-index
1–5 of 1.2K
Institutions
505
Carnegie Mellon University
Pittsburgh, United States
25 h-index
47 publications
5K citations
Georgia Institute of Technology
Atlanta, United States
18 h-index
40 publications
2.9K citations
University of Bologna
Bologna, Italy
14 h-index
23 publications
2.5K citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
14 publications
5.2K citations
Centre National de la Recherche Scientifique
Paris, France
12 h-index
22 publications
1.2K citations
UCLouvain
Louvain-la-Neuve, Belgium
11 h-index
16 publications
1.4K citations
Group for Research in Decision Analysis
Montreal, Canada
11 h-index
18 publications
899 citations
University of Florida
Gainesville, United States
11 h-index
21 publications
572 citations
1–8 of 505
Venues
- Mathematical Programming
66 publications · 4.9K citations
37
h-index
- Operations Research
38 publications · 4.7K citations
26
h-index
- European Journal of Operational Research
34 publications · 3.6K citations
23
h-index
- SIAM Journal on Optimization
31 publications · 2K citations
23
h-index
- INFORMS journal on computing
26 publications · 1.2K citations
19
h-index
1–5