We provide a comprehensive overview of the literature of algorithmic approaches for
multiobjective mixed‐integer and integer linear optimization problems. More precisely, we …

In parallel computing, the scheduling of the tasks of an application onto the processors of the
parallel system is crucial. A task schedule determines both the allocation of tasks to the …

For a continuous multi-objective optimization problem, it is usually not a practical approach
to compute all its nondominated points because there are infinitely many of them. For this …

We present a branch-and-bound algorithm for minimizing multiple convex quadratic
objective functions over integer variables. Our method looks for efficient points by fixing …

The ε-constraint method is a well-known scalarization technique used for multiobjective
optimization. We explore how to properly define the step size parameter of the method in …

Novel repair-and-support ships could provide spot systemic maintenance and repair (MR)
services for damaged offshore platforms on a deep sea, competing against shipyards …

In this thesis, objective space based exact solution algorithms for biobjective mixed integer
programming problems are proposed. The algorithms solve scalarization models in order to …

The ε-constraint method is a well-known scalarization technique used for multiobjective
optimization. We explore how to properly define the step size parameter of the method in …