Originally posted by: Mintch Zulitch
Very thanks for your answer,
Branch-and-cut is a generalization of branch-and-bound where, after solving the LP relaxation, and having not been successful in pruning the node on the basis of the LP solution, we try to find a violated cut. If one or more violated cuts are found, they are added to the formulation and the LP is solved again. If none are found, we branch.
The cut-generating procedures are classified as follows:
General purpose
Relaxation
Problem specific
#DecisionOptimization#OPLusingCPLEXOptimizer