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…