TY - JOUR U1 - Zeitschriftenartikel, wissenschaftlich - nicht begutachtet (unreviewed) A1 - Büchel, Alexander A1 - Gilleßen, Ulrich A1 - Witt, Kurt-Ulrich T1 - An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums N2 - To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add up to the same sum. KW - Cutting sticks problem KW - Set partition problem U6 - https://doi.org/10.48550/arXiv.1706.06425 DO - https://doi.org/10.48550/arXiv.1706.06425 AX - 1706.06425 SP - 12 S1 - 12 PB - arXiv ER -