research
∙
05/24/2023
Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory
We study the approximation of general multiobjective optimization proble...
share
research
∙
05/24/2023
Approximating Multiobjective Optimization Problems: How exact can you be?
It is well known that, under very weak assumptions, multiobjective optim...
research
∙
01/31/2023
p-median location interdiction on trees
In p-median location interdiction the aim is to find a subset of edges i...
research
∙
10/03/2022
A machine learning based algorithm selection method to solve the minimum cost flow problem
The minimum cost flow problem is one of the most studied network optimiz...
research
∙
09/21/2021
An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems
In a widely studied class of multi-parametric optimization problems, the...
research
∙
09/21/2021
Approximating Biobjective Minimization Problems Using General Ordering Cones
This article investigates the approximation quality achievable for biobj...
research
∙
10/06/2020
On the Bicriterion Maximum Flow Network Interdiction Problem
This article focuses on a biobjective extension of the maximum flow netw...
research
∙
05/08/2020
Sparsifying Parity-Check Matrices
Parity check matrices (PCMs) are used to define linear error correcting ...
research
∙
04/17/2020
The two player shortest path network interdiction problem
In this article, we study a biobjective extension of the shortest path n...
research
∙
02/12/2020
The 0,1-knapsack problem with qualitative levels
A variant of the classical knapsack problem is considered in which each ...
research
∙
08/28/2019
One-Exact Approximate Pareto Sets
Papadimitriou and Yannakakis show that the polynomial-time solvability o...
research
∙
08/03/2019
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems
We determine the power of the weighted sum scalarization with respect to...
research
∙
06/12/2019
On the Universal Near-Shortest Simple Paths Problem
This article generalizes the Near-Shortest Paths Problem introduced by B...
research
∙
01/10/2019
A Reduced-Complexity Projection Algorithm for ADMM-based LP Decoding
The Alternating Direction Method of Multipliers has recently been adapte...
research
∙
08/28/2018
