## Packing Ellipsoids and Chromosomes

Problems of packing shapes with maximal density, possibly into a container of restricted size, are classical in discrete mathematics. We describe here the problem of packing ellipsoids of given (but varying) dimensions into a finite container, in a way that minimizes the maximum overlap between adjacent ellipsoids. A bilevel optimization …