6 citations · 6 across the 2 of their papers we have counts for
2 papers
math.OC2022
Algorithms to solve unbounded convex vector optimization problems
Andrea Wagner, Firdevs Ulus, Birgit Rudloff +2
This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs e…
math.OC2016★ 6 cited
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…