MST
Subsets
Partition
TSP
Ödev
given: 50 numbers with sum B
final static int[] A
= {12913, 13603, 14135, 15215, 16692, 17762, 18974, 20088, 20138,
20188, 21250, 24296, 24444, 25428, 25976, 27792, 28038, 31170,
31338, 32752, 34102, 35614, 37556, 39618, 40556, 41880, 42444,
43852, 44004, 46016, 48172, 50334, 50494, 51792, 53138, 53530,
53692, 56370, 56560, 59536, 60428, 62032, 62850, 62928, 66382,
68084, 68416, 69276, 69824, 70414};
find: a subset of these numbers with sum B/2 = 1021043
Referans
http://www.americanscientist.
