1.8k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of ViennaAT14 papers
- Sapienza University of RomeIT12 papers
- Complexity Science HubAT11 papers
- University of SalzburgAT9 papers
- Johannes Kepler University of LinzAT8 papers
- Humboldt-Universität zu BerlinDE7 papers
- The University of MelbourneAU7 papers
- TU WienAT7 papers
- ETH ZurichCH6 papers
- Queensland University of TechnologyAU5 papers
- University College DublinIE5 papers
- University of AmsterdamNL5 papers
9 papers · 1 filter
Deep Learning the Efficient Frontier of Convex Vector Optimization Problems
Zachary Feinstein, Birgit Rudloff
In this paper, we design a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition. The…
On unbounded polyhedral convex set optimization problems
Niklas Hey, Andreas Löhne
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the -dimensional to the -dimensional Euclidean space whose graph is a convex poly…
Characterizing and Computing the Set of Nash Equilibria via Vector Optimization
Zachary Feinstein, Birgit Rudloff
Nash equilibria and Pareto optimality are two distinct concepts when dealing with multiple criteria. It is well known that the two concepts do not coincide. However, in this work w…
A LP relaxation based matheuristic for multi-objective integer programming
Duleabom An, Sophie N. Parragh, Markus Sinnl +1
Motivated by their success in the single-objective domain, we propose a very simple linear programming-based matheuristic for tri-objective binary integer programming. To tackle th…
Dynamic Set Values for Nonzero Sum Games with Multiple Equilibriums
Zachary Feinstein, Birgit Rudloff, Jianfeng Zhang
Nonzero sum games typically have multiple Nash equilibriums (or no equilibrium), and unlike the zero sum case, they may have different values at different equilibriums. Instead of…
Certainty Equivalent and Utility Indifference Pricing for Incomplete Preferences via Convex Vector Optimization
Birgit Rudloff, Firdevs Ulus
For incomplete preference relations that are represented by multiple priors and/or multiple -- possibly multivariate -- utility functions, we define a certainty equivalent as well…
Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
Andreas Löhne, Andrea Wagner
A class of non-convex optimization problems with DC objective function is studied, where DC stands for being representable as the difference of two convex functions and…
A Parametric Simplex Algorithm for Linear Vector Optimization Problems
Birgit Rudloff, Firdevs Ulus, Robert Vanderbei
In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective s…
Set optimization - a rather short introduction
Andreas H. Hamel, Frank Heyde, Andreas Löhne +2
Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valu…