Heuristics and exact methods for number partitioning
Number partitioning is a classical NP-hard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from tree search, breadth first search, and beam search. A new set of benchmark instances for this problem is also proposed. The behavior of the new method on this and other testbeds is analyzed and compared to other well known heuristics and exact algorithms.
heuristics combinatorial optimization tree search number partitioning problem