## Reoptimization in branch-and-bound algorithms with an application to elevator control

Please always quote using this URN: urn:nbn:de:0297-zib-17876
• We consider reoptimization (i.e. the solution of a problem based on information available from solving a similar problem) for branch-and-bound algorithms and propose a generic framework to construct a reoptimizing branch-and-bound algorithm. We apply this to an elevator scheduling algorithm solving similar subproblems to generate columns using branch-and-bound. Our results indicate that reoptimization techniques can substantially reduce the running times of the overall algorithm.

$Rev: 13581$