Concepedia

Concept

branch and cut

Parents

590

Publications

50.6K

Citations

1.1K

Authors

501

Institutions

About

Branch and cut is a principal algorithmic methodology in combinatorial optimization for solving integer and mixed integer programming problems. It operates by systematically exploring the solution space via branching while simultaneously tightening the linear programming relaxation through the addition of valid inequalities (cutting planes). This approach is crucial for obtaining exact optimal solutions to computationally challenging discrete optimization problems across various fields.

Top Authors

Rankings shown are based on concept H-Index.

GL

Georgia Institute of Technology

MF

University of Padua

GL

HEC Montréal

FG

University of Colorado Boulder

MP

New York University

Top Institutions

Rankings shown are based on concept H-Index.

Georgia Institute of Technology

Atlanta, United States

Pittsburgh, United States

University of Bologna

Bologna, Italy

Polytechnique Montréal

Montreal, Canada

Top Venues

Rankings shown are based on concept H-Index.

Journal