Integrating pivot based search with branch and bound for binary MIPs

The paper examines integration of a sophisticated pivot-based tabu search technique into branch and bound for 0–1 MIPs and global diversification tests using chunking. Issues related to behaviour of the tabu search within a branch and bound algorithm are analysed using computational experiments. Results are presented showing that the inclusion of the local search sometimes entails fewer nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process.