activity
20082025
most citedMathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms

31 citations · 56 across the 23 of their papers we have counts for

collaborators
Showing math.OCShow all

9 papers · 1 filter

math.OC2025★ 1 cited

A Polynomial-Time Inner Approximation Algorithm for Multi-Objective and Parametric Optimization

Levin Nemesch, Stefan Ruzika, Clemens Thielen +1

In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicativ…

math.OC2025

A Survey of Exact and Approximation Algorithms for Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen +1

Linear-parametric optimization, where multiple objectives are combined into a single objective using linear combinations with parameters as coefficients, has numerous links to othe…

math.OC2023

Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems

Stephan Helfrich, Stefan Ruzika, Clemens Thielen

Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of…

math.OC2023

Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory

Stephan Helfrich, Arne Herzel, Stefan Ruzika +1

We study the approximation of general multiobjective optimization problems with the help of scalarizations. Existing results state that multiobjective minimization problems can be…

math.OC2023

Approximating Multiobjective Optimization Problems: How exact can you be?

Cristina Bazgan, Arne Herzel, Stefan Ruzika +2

It is well known that, under very weak assumptions, multiobjective optimization problems admit -approximation sets (also called -P…

math.OC2021

Approximating Biobjective Minimization Problems Using General Ordering Cones

Arne Herzel, Stephan Helfrich, Stefan Ruzika +1

This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal w…