2 papers
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.HO2019
MatchTheNet -- An Educational Game on 3-Dimensional Polytopes
Michael Joswig, Georg Loho, Benjamin Lorenz +1
We present an interactive game which challenges a single player to match 3-dimensional polytopes to their planar nets. It is open source, and it runs in standard web browsers