1 paper · 1 filter
Bernd Mulansky, Andreas Potschka
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has…