Abstract:
A computing scheme of the branch-and-bound method is described whereby the increase the solution effectiveness, in particular to save memory space and reduce the solution time, the branching is performed for several variables simultaneously. The scheme employs the so-called first strategy of branching. Computer solution of an integer linear programming problem.