We provide a comprehensive overview of the literature of algorithmic approaches for multiobjective mixed‐integer and integer linear optimization problems. More precisely, we categorize and display exact methods for multiobjective linear problems with integer variables for computing the entire...

Multi-objective optimization problems are often solved by a sequence of parametric single-objective problems, so-called scalarizations. If the set of nondominated points is finite, the entire nondominated set can be generated in this way. In the bicriteria case it is well known that this can be...

The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for example, in the field of multifacility location or medical image registration. Thereby, a function <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$f:X\times Y\to{\mathbb{R}}$$</EquationSource> </InlineEquation> is...</equationsource></inlineequation>

The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for example, in the field of multifacility location or medical image registration. Thereby, a function $$f:X\times Y\to{\mathbb{R}}$$ is called...