A complete anytime algorithm for balanced number partitioning

03/11/1999
by   Stephan Mertens, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2020

Multi-Way Number Partitioning: an Information-Theoretic View

The number partitioning problem is the problem of partitioning a given l...
research
10/27/2021

Average-Case Subset Balancing Problems

Given a set of n input integers, the Equal Subset Sum problem asks us to...
research
10/01/2012

Think Locally, Act Globally: Perfectly Balanced Graph Partitioning

We present a novel local improvement scheme for the perfectly balanced g...
research
07/07/2018

New Algorithms for Subset Sum Problem

Given a set (or multiset) S of n numbers and a target number t, the subs...
research
10/17/2021

On Monotonicity of Number-Partitioning Algorithms

An algorithm for number-partitioning is called value-monotone if wheneve...
research
01/27/2020

Load-Balanced Bottleneck Objectives in Process Mapping

We propose a new problem formulation for graph partitioning that is tail...
research
08/29/2023

Randomized Quasi Polynomial Algorithm for Subset-Sum Problems with At Most One Solution

In this paper we study the Subset Sum Problem (SSP). Assuming the SSP ha...

Please sign up or login with your details

Forgot password? Click here to reset