A New Branch and Bound Algorithm for Solving Complex Integer Quadratic Programs

Based on integer quadratic programs' characteristics, carried out in this paper are a series of improvements on the traditional branch-and-bound algorithm, which include the determination of the initial integer feasible solution by the HNF algorithm, the branching variable selection according to an newly introduced priority of variables and the node selection by utilizing variables' specific properties. An practical new-type branch-and-bound algorithm suitable for medium and large-scak; complex integer quadratic programs is thus derived, numerical results illustrate that the new algorithm is not only a great improvement on the traditional branch-and-bound algorithm, but suitable for different, complex problems.