Computer Science – Data Structures and Algorithms
Scientific paper
1999-03-11
Computer Science
Data Structures and Algorithms
12 pages, 5 figures
Scientific paper
Given a set of numbers, the balanced partioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible, subject to the constraint that the cardinalities of the subsets be within one of each other. We combine the balanced largest differencing method (BLDM) and Korf's complete Karmarkar-Karp algorithm to get a new algorithm that optimally solves the balanced partitioning problem. For numbers with twelve significant digits or less, the algorithm can optimally solve balanced partioning problems of arbitrary size in practice. For numbers with greater precision, it first returns the BLDM solution, then continues to find better solutions as time allows.
No associations
LandOfFree
A complete anytime algorithm for balanced number partitioning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A complete anytime algorithm for balanced number partitioning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A complete anytime algorithm for balanced number partitioning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-667391