120 citations · 186 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a secon…
A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a sec…