  We consider a fashion discounter that supplies any of its many branches with
an integral multiple of lots whose size assortment structure stems from a set
of many applicable lot-types. We design a column generation algorithm for the
optimal approximation of the branch and size dependent demand by a supply using
a bounded number of lot-types.
