31 citations · 56 across the 23 of their papers we have counts for
6 papers · 1 filter
p-median location interdiction on trees
Lena Leiß, Till Heller, Luca E. Schäfer +2
In p-median location interdiction the aim is to find a subset of edges in a graph, such that the objective value of the p-median problem in the same graph without the selected edge…
The two player shortest path network interdiction problem
Simon Busam, Luca E. Schäfer, Stefan Ruzika
In this article, we study a biobjective extension of the shortest path network interdiction problem. Each arc in the network is associated with two integer length values and two pl…
The {0,1}-knapsack problem with qualitative levels
Luca E. Schäfer, Tobias Dietz, Maria Barbati +3
A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the f…
One-Exact Approximate Pareto Sets
Arne Herzel, Cristina Bazgan, Stefan Ruzika +2
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit…
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems
Cristina Bazgan, Stefan Ruzika, Clemens Thielen +1
We determine the power of the weighted sum scalarization with respect to the computation of approximations for general multiobjective minimization and maximization problems. Additi…
Shortest Paths with Ordinal Weights
Luca E. Schäfer, Tobias Dietz, Nicolas Fröhlich +2
We investigate the single-source-single-destination "shortest" paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and effi…