AI-OR Experimentalists: Number Partitioning
This problem class was suggested by Rich Korf (korf@cs.ucla.edu). Given a
list of say 50 48-bit double-precision random integers, partition them into
two mutually exclusive and collectively exhaustive subsets, so that the sum
of the numbers in the two subsets are as nearly equal as possible. The
standard C library function drand48() can be used to generate problem
instances.