Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1016/0305-0548(95)E0020-L | Computers & OR |
Keywords | DocType | Volume |
Randomized method | Journal | 23 |
Issue | ISSN | Citations |
2 | Computers and Operations Research | 11 |
PageRank | References | Authors |
1.34 | 3 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Michael F. Argüello | 1 | 50 | 3.94 |
Thomas A. Feo | 2 | 163 | 23.88 |
Olivier Goldschmidt | 3 | 11 | 1.34 |