An improved exploratory search technique for pure integer linear programming problems

A heuristic procedure for the solution of pure integer linear programming problems is developed, and computational results are presented. The technique alternates sequences of local univariate exploratory moves with extrapolations (or pattern moves). The basis for the method is the intuitive presumption that a strategy that was successful in the past will be successful in the future. One example problem is presented in detail, and the results of numerous other test cases are also tabulated.<>