1 citations · 1 across the 5 of their papers we have counts for
7 papers
A machine learning based algorithm selection method to solve the minimum cost flow problem
Philipp Herrmann, Anna Meyer, Stefan Ruzika +2
The minimum cost flow problem is one of the most studied network optimization problems and appears in numerous applications. Some efficient algorithms exist for this problem, which…
On the Bicriterion Maximum Flow Network Interdiction Problem
Luca E. Schäfer, Stefan Ruzika, Sven O. Krumke +1
This article focuses on a biobjective extension of the maximum flow network interdiction problem, where each arc in the network is associated with two capacity values. Two maximum…
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…
On the Universal Near Shortest Simple Paths Problem
Luca E. Schäfer, Andrea Maier, Stefan Ruzika
This article generalizes the Near Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Ha…
Introducing Multiobjective Complex Systems
Tobias Dietz, Kathrin Klamroth, Konstantin Kraus +5
This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local co…