We talk about some specific discrete optimization problems, like best-packing or best-covering, on sets of low smoothness; for example, fractal sets. We will, in particular, study the behavior of the optimizers depending on how bad the fractal set is.