TY - GEN A1 - Achterberg, Tobias A1 - Koch, Thorsten A1 - Martin, Alexander T1 - Branching on History Information N2 - Mixed integer programs ($MIPs$) are commonly solved with branch and bound algorithms based on linear programming. The success and the speed of the algorithm strongly depends on the strategy used to select the branching variables. Today's state-of-the-art strategy is called \emph{pseudocost branching} and uses information of previous branchings to determine the current branching. We propose a modification of \emph{pseudocost branching} which we call \emph{history branching}. This strategy has been implemented in $SIP$, a state-of-the-art $MIP$ solver. We give computational results that show the superiority of the new strategy. T3 - ZIB-Report - 02-32 KW - Mixed Integer Programming KW - Branch-and-Bound KW - Branching Rules KW - Pseudocost Branching Y1 - 2002 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/699 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-6990 ER -