Minimum size generating partitions and their application to demand fulfillment optimization problems

Publication date: 20 September 2019

Abstract: For

n

and

k

integers we introduce the notion of some partition of

n

being able to generate another partition of

n

. We solve the problem of finding the minimum size partition for which the set of partitions this partition can generate contains all size-

k

partitions of

n

. We describe how this result can be applied to solving a class of combinatorial optimization problems.

This page was built for publication: Minimum size generating partitions and their application to demand fulfillment optimization problems