Randomized methods for the number partitioning problem

Randomized versions of Karmarkar and Karpʹs differencing method are introduced for the Number Partitioning problem. The development of these methods and a discussion of their merits are presented. It is shown that these randomized heuristics consistently yield better solutions than those generated by the differencing method.