13 citations · 15 across the 5 of their papers we have counts for
5 papers
An FPTAS for the Knapsack Problem with Parametric Weights
Michael Holzhauser, Sven O. Krumke
In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form for $i \in \{1,\ldots,n…
An FPTAS for the parametric knapsack problem
Michael Holzhauser, Sven O. Krumke
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution…
A Generalized Approximation Framework for Fractional Network Flow and Packing Problems
Michael Holzhauser, Sven O. Krumke
We generalize the fractional packing framework of Garg and Koenemann to the case of linear fractional packing problems over polyhedral cones. More precisely, we provide approximati…
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…