13 citations · 26 across the 17 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2019
Packing under Convex Quadratic Constraints
Max Klimm, Marc E. Pfetsch, Rico Raber +1
We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-fa…
math.OC2017
On the Complexity of Instationary Gas Flows
Martin Groß, Marc E. Pfetsch, Martin Skutella
We study a simplistic model of instationary gas flows consisting of a sequence of k stationary gas flows. We present efficiently solvable cases and NP-hardness results, establishin…