| Article ID: | iaor19962213 |
| Country: | United Kingdom |
| Volume: | 23 |
| Issue: | 2 |
| Start Page Number: | 103 |
| End Page Number: | 111 |
| Publication Date: | Feb 1996 |
| Journal: | Computers and Operations Research |
| Authors: | Argello Michael F. |
| Keywords: | partitioning |
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.