A modified branch-and-bound method for solution of a sequence of problems

A modified branch-and-bound method is considered whereby a sequence of problems in discrete-time optimization is solved faster than by independent solution of every problem in the sequence. The potential of the proposed approach is illustrated with solution of some sequences. Results are reported of experimental testing with sequences of problems in integer linear programming.