This chapter is devoted to recent developments of vector and set optimization. Based on the concept of a pre-order optimal elements are defined. In vector optimization properties of optimal elements and existence results are gained. Further, an introduction to vector optimization with a variable...

For many practical applications it is important to determine not only a numerical approximation of one but a representation of the whole set of globally optimal solutions of a non-convex optimization problem. Then one element of this representation may be chosen based on additional information...

In this paper, we study a method for finding robust solutions to multiobjective optimization problems under uncertainty. We follow the set-based minmax approach for handling the uncertainties which leads to a certain set optimization problem with the strict upper type set relation. We introduce,...

Mixed-Integer optimization represents a powerful tool for modelling many optimization problems arising from real-world applications. The Feasibility pump is a heuristic for finding feasible solutions to mixedinteger linear problems. In this work, we propose a new feasibility pump approach for...

In this work, we study continuous reformulations of zero-one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero-one programming problem can be obtained by solving a specific continuous problem.

Mixed-Integer optimization represents a powerful tool for modeling manyoptimization problems arising from real-world applications. The Feasibilitypump is a heuristic for finding feasible solutions to mixed integer linear problems. In this work, we propose a new feasibility pump approach using...

We propose a branch-and-bound algorithm for minimizing a not necessarily convex quadratic function over integer variables. The algorithm is based on lower bounds computed as continuous minima of the objective function over appropriate ellipsoids. In the nonconvex case, we use ellipsoids...

Mixed-Integer optimization is a powerful tool for modeling many optimization problems arising from real-world applications. Finding a rst feasible solution represents the rst step for several MIP solvers. The Feasibility pump is a heuristic for nding feasible solutions to mixed integer linear...

Mixed-Integer optimization is a powerful tool for modeling many optimization problems arising from real-world applications. Finding a first feasible solution represents the first step for several MIP solvers. The Feasibility pump is a heuristic for finding feasible solutions to mixed integer...