Binary cut-and-branch method for solving mixed integer programming problems

The report is dedicated to the description of the algorithm for one of the methods for solving mixed-integer linear programming problems, which is based on binary cuttings. One of its algorithms, a hybrid algorithm based on binary cuts and branches, which combines the idea of the branch-and-bound method with the construction of cutting planes, is extended to milp problems.