In multi-objective mixed-integer convex optimization, multiple convex objective functions need to be optimized simultaneously while some of the variables are restricted to take integer values. In this paper, we present a new algorithm to compute an enclosure of the nondominated set of such...

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 rarely applied compared to the predominant objective space methods. In this paper we propose modifications to...

In this paper, we present an outer approximation algorithm for computing the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices) as well as the facets of the Edgeworth–Pareto hull. We note that...

With ever-rising student numbers and an increasing shift towards more interdisciplinary study programs, the requirements for finding schedules for courses and exams become ever more complex. In real-world scenarios, the models used for calculating solutions to the course and the examination...