An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums
From MaRDI portal
Publication:6288092
arXiv1706.06425MaRDI QIDQ6288092FDOQ6288092
Authors: A. Buchel, Ulrich Gilleßen, Kurt-Ulrich Witt 
Publication date: 20 June 2017
Abstract: 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.
This page was built for publication: An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6288092)
