Refine
Year of publication
Document Type
- In Proceedings (8)
- ZIB-Report (8)
- Article (4)
- Book (1)
- Book chapter (1)
Language
- English (22)
Is part of the Bibliography
- no (22)
Keywords
- elevator control (2)
- eulerian multigraphs (2)
- scheduling (2)
- Aufzugssteuerung (1)
- Depot Planning (1)
- Exakte Reoptimierung (1)
- Mixed-Integer Nonlinear Programming (1)
- Onlineoptimierung (1)
- Railway Track Assignment (1)
- branch-and-bound (1)
Institute
- Mathematical Optimization (22) (remove)
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.