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

2019/09/20 by Jones, Bo, Carlsson, John Gunnar
#Combinatorics (math.CO) #FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1909.09363

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.

Related

• Separable Integer Partition Classes
• Problems and results on judicious partitions
• M-partitions: Optimal partitions of weight for one scale pan
• Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
• Minimum-weight partitioning of a set with associated subsets