3 papers
math.OC2023
Adaptive Improvements of Multi-Objective Branch and Bound
Julius Bauß, Sophie N. Parragh, Michael Stiglmayr
Branch and bound methods which are based on the principle "divide and conquer" are a well established solution approach in single-objective integer programming. In multi-objective…
math.OC2023
Adapting Branching and Queuing for Multi-objective Branch and Bound
Julius Bauß, Michael Stiglmayr
Branch and bound algorithms have to cope with several additional difficulties in the multi-objective case. Not only the bounding procedure is considerably weaker, but also the hand…
math.OC2023
Augmenting Bi-objective Branch and Bound by Scalarization-Based Information
Julius Bauß, Michael Stiglmayr
While Branch and Bound based algorithms are a standard approach to solve single-objective (mixed-)integer optimization problems, multi-objective Branch and Bound methods are only r…