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

Multi-objective integer or mixed-integer programming problems typically have disconnected
feasible domains, making the task of constructing an approximation of the Pareto front …

In this paper, we have presented a computational algorithm based on normalization for
constructing the Pareto front (PF) in multi-objective optimization problems (MOP). Some …

Exactly solving multiobjective integer programming (MOIP) problems is often a very time-
consuming process, especially for large and complex problems. Parallel computing has the …

Many real-world optimization problems can be expressed as a linear program with integer
variables, eg in logistics, scheduling, supply chain management, ect. Usually, an objective is …

We present OOESAlgorithm. jl, a package for optimizing a linear function over the efficient
set of biobjective mixed integer linear programs. The proposed package extends our recent …

We present a new exact method for bi-objective pure integer linear programming, the so-
called Multi-Stage Exact Algorithm (MSEA). The method combines several existing exact …

This thesis presents a total of 3 groups of contributions related to multi-objective
optimization. The first group includes the development of a new algorithm and an open …

In many real-world problems, decision makers face several, often conflicting objectives that
have to be optimised simultaneously. This falls in the realm of multiobjective optimisation …

This thesis presents a total of 3 groups of contributions related to multi-objective
optimization. The first group includes the development of a new algorithm and an open …