Blocked branch-and-bound method
We consider the choice of an optimal branching strategy in the branch- and-bound method (in the sense of minimum deviation from the optimal integer program) under constraints on computer time and memory. A blocked version of the branch-and-bound method has been developed, based on a block branching strategy. An approximate method of branching optimization is proposed, increasing the efficiency of the branch-and-bound solution. Some results of a computer experiment are given and a numerical example is analyzed.
scientific article; zbMATH DE number 3991282