User:Bmears11/mysandbox/Integer Linear Programming/branch and cut
From Wikipedia, the free encyclopedia
Branch and cut (sometimes written as branch-and-cut) is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values[1] . Branch and cut involves running a branch and bound algorithm and using cutting planes to tighten the LP relaxations. Note that if cuts are only used to tighten the initial LP relaxation, the algorithm is called cut and branch.